50
Instructions:
- • Click and drag to draw walls
- • = Start node
- • = End node
- • = Wall
- • = Visited
- • = Path
Dijkstra's Algorithm
Finds shortest path using a priority queue (min-heap). Guarantees optimal path for non-negative edge weights. Foundation for many routing algorithms.
Time Complexity
Best:
O((V + E) log V)Average:
O((V + E) log V)Worst:
O((V + E) log V)Space Complexity
O(V)Color Legend
Default
Comparing
Swapping
Sorted
Pivot
Setting Value