A powerful isochrone and routing engine based on Dijkstra's algorithm for accurate travel time calculations.

A TypeScript library for calculating shortest paths between geographical points using Dijkstra's algorithm and Haversine distance

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

A simple and visual mesh router library using Dijkstra's algorithm. Create nodes and edges, calculate the shortest path, and visualize it easily in React.

Implementation of the Dijkstra's Algorithm to compute the shortest path between a starting and ending node ina graph.

A JS library for finding optimal label position inside a polygon

Find the longest common subsequence.

graph algorithm

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

dynamic shortest path algorithim

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 point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons