ConceptTheory & Algos
Bellman-Ford algorithm correctness theorem
If a graph contains no negative weight cycles, the Bellman-Ford algorithm correctly computes the shortest path distances from a source to all vertices.
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.