Algorithm Packages

Implementation of the Aho-Corasick string searching algorithm, as described in the paper "Efficient string matching: an aid to bibliographic search".

Shuffle the words in a string and optionally the letters in each word using the Fisher-Yates algorithm. Useful for creating test fixtures, benchmarking samples, etc.

Fast string editing in Javascript using skip lists

TypeScript-STL (Standard Template Library, migrated from C++)

Park-Miller pseudorandom number generator (PRNG)

Simple fuzzy matching

User-friendly pseudorandom number generator (PRNG)

A simple function that conforms npm package version matching behavior.

FPGrowth frequent itemset mining algorithm implementation in TypeScript / JavaScript.

a general purpose genetic algorithm, an A.I. tool useful for machine evolution and adaptation

Efficiently sort interdependent tasks into a sequence of concurrently-executable batches.

Create a clone of an object that is accepted by the Structured Clone Algorithm

A generator of numbers that passes the validation of Luhn algorithm or Luhn formula, also known as the 'modulus 10' or 'mod 10' algorithm

Node.js implement of some base algorithm and base data-structure.

Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph.

loadbalance

Topological sort in JavaScript

a topological cyclic sorting algorithm based on depth-first search (dfs)

Tree utilities

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.