Dijkstra's Algorithm
Shortest paths in a weighted network, one node at a time. Why the closest unfinished node is always final, how a heap finds it, and why a negative edge breaks the idea.
Spotted a mistake in this lesson?Report an issue →
Shortest paths in a weighted network, one node at a time. Why the closest unfinished node is always final, how a heap finds it, and why a negative edge breaks the idea.