ConceptTheory & Algos
Ford-Fulkerson algorithm
An iterative algorithm for finding the maximum flow in a flow network by repeatedly finding augmenting paths in the residual graph.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
5The lectures that define it or assume it, and the concepts next to it.