home/visualizer/Dijkstra's Algorithm

Dijkstra's Algorithm

Shortest path in weighted graph using a min-heap. LC 743, 787, 1631.

Unvisited
In heap
Processing
Finalized
Shortest path

Controls

Time: O((V+E) log V) | Space: O(V)

Steps

0 steps

Press Run to trace the algorithm one step at a time.