Package provides javascript implementation of algorithms for graph processing
JavaScript
154
40
MIT License
This JavaScript library provides implementations of various graph algorithms for both directed and undirected graphs. It's designed for developers who need to process graphs in their applications, offering features like depth-first search, breadth-first search, connected components, topological sorting, minimum spanning trees, shortest path algorithms (Dijkstra, Bellman-Ford), and maximum flow algorithms.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies
Support the repos that depend on this repository
Top contributors
chen0040
47 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
