Finds the shortest paths from a single source vertex to all other vertices in a non-negative weighted graph. Uses a Priority Queue to greedily settle the closest unvisited node. Ties are broken alphabetically.
SlowFast
Current Vertex: -
Priority Queue Size: 0
Settled Vertices: 0 / 6
Algorithm State: Ready
Unvisited
Evaluating / Relaxing
Settled (Visited)
Shortest Path Tree
Priority Queue Min-Heap (Distance, Label)
Vertex
Priority (Dist)
Status
Shortest Distances Table Click any row to trace path
Vertex
Distance
Path Via
Select a source vertex and click "Step" or "Auto Play" to begin single-source path relaxation.