ConceptTheory & Algos
Breadth-first augmenting path
A shortest path from source to sink in the residual graph, where each edge is counted as having weight 1.
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.