A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

Solves minimum-cost flow problems using the successive shortest paths algorithm

Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)

Simple and fast library for graphs and calculating shortest paths

Computes the K shortest paths in a graph from node s to node t using Yen's algorithm

A modern JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.

Implementation of Floy-Warshall's algorithm for finding shortest paths in a directed weighted graph.

Shortest path functions for graphology.

TypeScript-first graph toolkit for Node.js and browsers with typed vertices and edges, directed and undirected graphs, traversal, shortest paths, components, cycles, spanning trees, subgraphs, matrix representations, events, serialization, and views.

LavaMoat's secure package naming convention

A TypeScript implementation of Dijkstra's algorithm for finding shortest paths in graphs

TypeScript implementation of Dijkstra's single-source shortest-paths algorithm, including performance optimizations based on the `heapq` Python library.

TypeScript implementation of the algorithm that breaks the sorting barrier for directed single-source shortest paths

Load node modules according to tsconfig paths, in run-time or via API.

Given some data, jsesc returns the shortest possible stringified & ASCII-safe representation of that data.

A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.

Encode compact, canonical JSON.

Get paths for storing things like data, config, cache, etc

Get the first path that exists on disk of multiple paths

shortest paths that become 'more popular' with repeated use. simulate forest trail formation, infrastructure network growth, plant root growth, mold growth, other analogous phenomena, etc.