ConceptTheory & Algos
Shortest path weight
The shortest path weight from u to v is defined as the minimum weight over all paths from u to v, or infinity if no such path exists.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.