A generic search algorithm for complex objects
Performant search algorithm optimized for descriptive texts
Performant search algorithm optimized for descriptive texts
astar search algorithm in JavaScript
Generic synchronous A* search algorithm
Lua implementation of fzy string search algorithm
Binary search algorithm for sorted arrays
unified-doc micromatch search algorithm.
A star search algorithm implementation in TypeScript
Binary search algorithm
SynTest search algorithm plugin for experimental search algorithms
Full Text Search Algorithm
Javascript implementation of the Vantage-Point Tree nearest neighbor search algorithm
Tarjan-Lengauer dominator search algorithm
AStar pathfinding search algorithm written in JavaScript, forked from bgrins/javascript-astar
A TypeScript implementation of binary search algorithm for browsers and Node.js
Binary search algorithm
Automatically compress images to exact file size using binary search algorithm.
Performant search algorithm optimized for descriptive texts
A* search algorithm for asynchronous data sources
Search algorithm for short texts
An almost universal implementation of A* search algorithm in JavaScript
astar search algorithm in JavaScript
A lightweight fuzzy search algorithm
Implementing user-friendly search interfaces in Rust. no-std. Zero dependencies.
A command-line tool for solving Queens puzzles
Metaheuristics include Genetic Algorithms (GAs), such as ALPS and tournament selection.
A pure Ruby implementation of gBFS
This gem provides ruby library with Aho-Corasick substring search algorithm implementation.
This gem provides ruby library with algorithms for trie based substring search.
Ruby wrapper for Boyer-Moore - The fastest search strategy, ever!
Kibo is a small library that implements classic algorithms like binary search, merge, sort, bubble sorts, etc..
A* Search Algorithm for PNG images
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.
A module dedicated to search algorithms studies in Ruby based on interactor's architecture
The binary search algorithm is extracted from Jon Bentley's # Programming Pearls 2nd ed. p.93
A gem to execute Variable Neighborhood Search algorithm in optimization problems
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.