Dijkstra

Shortest path on a weighted graph, step by step

About this tool

Step-by-step shortest path on a small weighted graph. Algorithms: Dijkstra, Bellman-Ford, BFS, A*.