DynamicDijkstra is a library that implements Dijkstra's shortest path algorithm for dynamically updating weighted directed graphs. It's designed for applications like secure scuttlebutt that need to efficiently update shortest paths when edges are added or removed. The library provides traversal, update, and configuration APIs optimized for this use case.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of dominictarr/dynamic-dijkstra
binary heap (priority queue) algorithms (ported from Python's heapq module)
Deep merge objects with custom merging logic
minimal pull stream
tap-producing test harness for node and browsers
Support the repos that depend on this repository
Top contributors
dominictarr
51 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet