← CS_basics
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
Nodes
8
Speed
Run
Reset
Time: O((V+E) log V) | Space: O(V)
Steps