ConceptTheory & Algos
Potential method for shortest paths
A technique to modify edge weights using potential functions such that all shortest paths remain unchanged.
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.