Knuth's Dancing Links algorithm for the exact cover problem
Implementantion of Knuth's dancing links algorithm
Puzzle solver based on dancing links algorithm
JWA implementation (supports all JWS algorithms)
Self-host the Dancing Script font in a neatly bundled NPM package.
Implementation of JSON Web Signatures
Use the Dancing Script font family from Google Fonts in your Expo app
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Self-host the Dancing Script font in a neatly bundled NPM package.
Detect the indentation of code
Gatsby transformer plugin for images using Sharp
Sniff the encoding from a HTML byte stream
Simple “Least Recently Used” (LRU) cache
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
The lightest signal library.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
JavaScript package binary linker
Simple and Performant Language detection library (pure JS and zero dependencies)
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Parse a JSON string that has git merge conflicts, resolving if possible
Dancing link + Algorithm X
Base implementation for all Sentry JavaScript SDKs
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Hashing made simple. Get the hash of a buffer/string/stream/file.
Dancing-links is an implementation of the "Dancing Links" algorthm to solve the "Exact Cover" problem. Algorithm found by Donald Knuth.
Library for solving Sudoku-like puzzles (Sudoku, Hexadoku, etc.) using the Dancing Links algorithm.
Implementation of D.Knuth 'dancing links' algorithm to solve the exact cover problem.