ConceptTheory & Algos
Edge relaxation
Updating the distance estimate of a vertex if a shorter path to it through another edge is found.
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.
Graph representation1Shortest path1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
6The lectures that define it or assume it, and the concepts next to it.