ConceptTheory & Algos
Edmonds-Karp algorithm
An algorithm that uses breadth-first search to find augmenting paths in the residual graph to compute maximum flow.
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
4The lectures that define it or assume it, and the concepts next to it.