Edmond's weighted maximum matching algorithm (Blossom algorithm) ported from http://jorisvr.nl/maximummatching.html
A string similarity utility that uses the Jaro-Winkler algorithm
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
Library elements of the AVSDF algorithm
Takes a set of points and partition them into clusters according to DBSCAN's data clustering algorithm.
Simplify geometry using the Ramer–Douglas–Peucker algorithm.
Provide sha512crypt algorithm for nodejs
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
x11 javascript hashing algorithm in pure javascript
CART decision tree algorithm
Liang-Barsky line clipping algorithm
An Implementation of Jaro Distance Algorithm by Matthew A. Jaro
Lempel-Ziv-Welch (LZW) compression algorithm
TypeScript implementation of DDSketch, a distributed quantile sketch algorithm
LZ-based compression algorithm
Edmond's weighted maximum matching algorithm (Blossom algorithm) ported from http://jorisvr.nl/maximummatching.html
MarchingSquaresJS - An implementation of the Marching Squares algorithm featuring Isocontour and Isoband computation.
k-nearest neighbors algorithm
Text TOC-fill algorithm implementation
Implementation of paper 'An O(ND) Difference Algorithm and Its Variations' on array
The ELK layout algorithm adapter for Cytoscape.js
Simple 32 bit FNV-1a hash algorithm implementation.
CRC32 generation using Slicing-by-N algorithm
hast utility to get the plain-text value of a node according to the `innerText` algorithm