ConceptTheory & Algos
Shortest path recursive structure
The shortest path distance to a vertex v can be computed by taking the minimum over all incoming edges of the shortest path to u plus the weight of edge uv.
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.