ConceptTheory & Algos
Residual graph
A graph derived from a flow network and a current flow, representing the remaining capacity on each edge.
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
8The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Flow
- Flow network
- Augmenting path
- Breadth-first augmenting path
- Edmonds-Karp algorithm
- Ford-Fulkerson algorithm