A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
JavaScript
48
16
Other
dijkstrajs is a simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm, designed to find the shortest paths in a graph from a single source node. It's ideal for developers working with graph data structures in JavaScript who need an efficient way to calculate shortest paths, particularly those using Node.js for their projects.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of tcort/dijkstrajs
BDD style assertions for node and the browser.
Static analysis tool for JavaScript
simple, flexible, fun test framework
Support the repos that depend on tcort/dijkstrajs
Top contributors
tcort
18 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet