KnowraFlow networkLinked fromLinked fromThe 9 pages that link to Flow network, each with the reason it gives.All 9Broader topic 1Narrower topic 8Augmenting pathNarrower topic: The path operates within this capacity-constrained structure.Maximum flow problemNarrower topic: It supplies the graph, capacities, source, and sink that define the problem.Flow conservationNarrower topic: Its vertices and directed edges provide the setting for conservation constraints.Residual graphNarrower topic: It supplies the capacities and current flow from which residual edges are derived.Ford–Fulkerson algorithmNarrower topic: It is the input structure whose feasible source-to-sink flow the algorithm maximizes.Edmonds–Karp algorithmNarrower topic: Edmonds–Karp solves the maximum-flow problem on this broader structure.Max-flow min-cut theoremNarrower topic: The theorem applies to feasible flows and cuts in this capacitated structure.Directed networkBroader topic: Directed links specify allowable movement in models of transport and allocation.Push–relabel maximum flow algorithmNarrower topic: Push–relabel operates on this capacitated source-to-sink structure.