ConceptTheory & Algos
Generic shortest path algorithm
A framework for finding shortest paths by repeatedly selecting and relaxing edges until no more relaxations are possible.
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.