Search npm for packages to use with Deno

Shortest path functions for graphology.

Shortest path strategies in JS

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

typescript implementation of the greedy first search djikstra's shortest path algorithm, compatible with javascript projects too of course

Graph based algorithm for traversing and finding the shortest path between two countries

A special case of best-first graph search that uses heuristics to improve speed. Define your 2D grid then add any blocked coordinates to the environment that must be avoided when generating the shortest path. Written in CoffeeScript.

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

Help to find the shortest path in a graph

A simple undirected graph that allows for finding the shortest path between nodes via Dijkstra's algorithm

Topological sort of directed ascyclic graphs (like dependecy lists)

A simple, minimal, no nonsense graph library with shortest-path finding.

A directed and undirected multi-graph library

Get the dependency tree of a module

Topological sort of directed acyclic graphs (like dependecy lists)

sort module-deps output for deterministic browserify bundles

Parse sass files and extract a graph of imports

Graph layout for JavaScript

walk the dependency graph to generate json output that can be fed into browser-pack

Simple path related functions for graphology.

Topological sort on directed graphs.