ConceptTheory & Algos
Inductive step for Dijkstra's correctness
Assuming Dijkstra's algorithm computes correct shortest paths for all node sets up to size , one analyzes the addition of the -st node to prove correctness for size .
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.