ConceptTheory & Algos
Inductive proof of Bellman-Ford
Proving the correctness of Bellman-Ford by showing that after passes, the shortest paths of edges are correctly computed.
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
3The lectures that define it or assume it, and the concepts next to it.