Shortest path | npm.io

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 3 years ago

Bellman-ford algorithm.

algorithm bellman-ford shortest path single source shortest path

4.0.4 • Published 1 year 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 3 years ago

Documentation app: [raikuxq-algorithms.netlify.app/guide](https://raikuxq-algorithms.netlify.app/guide)

algorithms data structures graph undirected graph directed graph breadth-first depth-first BFS DFS shortest path

1.2.5 • Published 3 years ago