Fast, iterative implementation of Heap's Algorithm

Heap's algorithm for generating permutations of an array.

Permutant finds every possible permutation of an array using Heap's Algorithm.

Efficient TypeScript implementation of Heap's algorithm to generate all permutations of a given array

JWA implementation (supports all JWS algorithms)

Implementation of JSON Web Signatures

Path finding in a graph

Generates all possible permutations of the input array or string using [Heap's algorithm](https://en.wikipedia.org/wiki/Heap%27s_algorithm), which minimizes movement.

Detect the indentation of code

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Simple “Least Recently Used” (LRU) cache

The fastest and smallest JavaScript polygon triangulation library for your WebGL apps

Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)

An implementation of the Unicode Line Breaking Algorithm (UAX #14)

The lightest signal library.

The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement

Parse a JSON string that has git merge conflicts, resolving if possible

Simple “Least Recently Used” (LRU) cache

Hashing made simple. Get the hash of a buffer/string/stream/file.

A JS library for finding optimal label position inside a polygon