Single source shortest path | npm.io

Bellman-ford algorithm.

algorithm bellman-ford shortest path single source shortest path

4.0.0 • Published 2 months ago

The algorithm to find the maximum matching of the bipartite graph.

algorithm bipartite-graph-matching bipartite-graph-matching + priority-queue shortest path single source shortest path

2.0.14 • Published 2 years ago

Dijkstra algorithm optimized with priority queue.

algorithm dijkstra dijkstra + priority-queue shortest path single source shortest path

4.0.0 • Published 2 months ago

Dijkstra algorithm (bigint version) optimized with @algorithm.ts/priority-queue.

algorithm dijkstra (bigint version)dijkstra + priority-queue shortest path single source shortest path

2.0.14 • Published 2 years ago