iddfs
iterative deepening depth-first search (IDDFS) for JavaScript
iterative deepening depth-first search (IDDFS) for JavaScript
Advanced genetic and evolutionary algorithm library (no web workers fork)
wanli algorithm
Calulates how full a grid will be if each item is spaced out by a given amount
Solves the traveling salesman problem using simulated annealing.
A implementation of a variant of k-means algorithm to get groups from the waypoints with the same size
A fair grouping mechanism for tournaments
Implementation of the k-means algorithm to partition the values into the clusters.
A curated set of essential algorithms and data structures for TypeScript
Sieve of Eratosthenes implementation.
interval tree in javascript
Arrange elements in a list
Fast string searching algorithms.
Node Js encryption module for triple des
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
JavaScript library for breadth-first traversal on image
An implementation of Levenshtein string distance in JS
A Custom Sass Import Resolver with included support for Node Module Resolution and additional file extensions
Shuffle a collection of weighted values
A* search algorithm for asynchronous data sources