ConceptTheory & Algos
Correctness of Dijkstra's algorithm
The proof that the distance computed by Dijkstra's algorithm is indeed the shortest path distance from to .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Dijkstra's algorithm1Non-negative edge weights1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.