ConceptTheory & Algos
Predecessor relationship
A pointer storing the predecessor vertex on the best path to .
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 traversal1Shortest path weight1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.