Linked from

The 10 pages that link to Residual graph, each with the reason it gives.

• Augmenting pathNarrower topic: An augmenting path is defined by traversing this graph’s positive-capacity edges.

• Maximum 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.

• Ford–Fulkerson algorithmBroader topic: It records which forward and reverse adjustments remain possible after each augmentation.

• 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.

• Minimum-cost flow problemBroader topic: Reverse arcs let an algorithm undo earlier routing choices when improving cost.

• Push–relabel maximum flow algorithmRelated: Pushes use residual capacity, including reverse edges that undo earlier flow.