KnowraResidual graphLinked fromLinked fromThe 10 pages that link to Residual graph, each with the reason it gives.All 10Broader topic 2Related 7Narrower topic 1Maximum flow problemRelated: It shows which adjustments remain possible after a flow has been assigned.Flow networkRelated: It reveals which changes can increase the current flow.Edmonds–Karp algorithmRelated: Breadth-first search finds augmenting paths in this graph, whose edges change after every augmentation.Max-flow min-cut theoremRelated: When no residual source-to-sink path remains, the reachable vertices determine a minimum cut.Circulation problemRelated: Residual paths let flow algorithms repair imbalances created by lower bounds.Bellman–Ford algorithmRelated: Reverse edges can have negative costs, making Bellman–Ford useful in flow algorithms.Push–relabel maximum flow algorithmRelated: Pushes use residual capacity, including reverse edges that undo earlier flow.