Shortest path functions for graphology.

AURA - Adaptive Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Aura, Dijkstra, A*).

Returns the shortest path from start to end without colliding with any Feature in obstacles.

Country land-border graph + shortest-path and deterministic daily-challenge engine. The pure geography engine behind Frontle.

Package implements data structures and algorithms for processing various types of graphs

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

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

Encode compact, canonical JSON.

prints a dependency graph in dot format for your typescript or react project

Parse sass files and extract a graph of imports

Path finding in a graph

Graph layout for JavaScript

A NodeJS implementation of Dijkstra's algorithm

Topological sort of directed ascyclic graphs (like dependecy lists)

Simple dependency graph.

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

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

xyflow core system that powers React Flow and Svelte Flow.

Create graphs from module dependencies.

LavaMoat's secure package naming convention