residualgraph
A residual graph, in the context of network flow theory, is a directed graph that represents how much additional flow can be pushed through a given flow in a network. It is derived from an original network with a designated set of capacities and a feasible flow. The residual graph depends on the current flow and is used to guide further augmentation of that flow.
Construction: Let G = (V, E) be a directed graph with capacity function c: E -> R+ and a
Purpose and use: The residual graph encodes all ways to increase or decrease the current flow. Augmenting
Relation to related concepts: The terms residual graph and residual network are often used interchangeably in