Linked from

The 11 pages that link to Flow conservation, each with the reason it gives.

• Augmenting pathRelated: Augmenting a complete source-to-sink path preserves conservation at its intermediate vertices.

• Maximum flow problemRelated: It prevents flow from appearing or disappearing at intermediate network locations.

• Residual graphRelated: Residual adjustments preserve this balance at intermediate vertices.

• Flow networkRelated: It prevents quantities from accumulating or disappearing at intermediate vertices.

• Ford–Fulkerson algorithmRelated: Augmentations preserve this constraint at every vertex other than the source and sink.

• Edmonds–Karp algorithmRelated: Every augmentation preserves this balance at intermediate vertices.

• Little's lawRelated: Stable throughput lets arrivals and departures define a consistent average population.

• Max-flow min-cut theoremRelated: Conservation makes the net flow across every source–sink cut equal the flow's value.

• Circulation problemRelated: It is the defining balance condition at every vertex in a circulation.

• Minimum-cost flow problemRelated: It expresses the balance equations that every feasible flow must satisfy.

• Push–relabel maximum flow algorithmRelated: The algorithm temporarily relaxes conservation at intermediate vertices, then restores it.