ConceptTheory & Algos
Bellman-Ford algorithm (DP view)
By introducing a parameter for the number of edges used, shortest paths on cyclic graphs can be computed in time using dynamic programming.
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.