ConceptTheory & Algos
Non-negative edge weight assumption
The requirement that all edge lengths , which ensures path lengths are non-decreasing when extended and is necessary for Dijkstra's correctness proof.
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.