Linked from

The 5 pages that link to Circulation problem, each with the reason it gives.

• Maximum flow problemRelated: It generalizes source-to-sink flow to networks with multiple supplies and demands.

• Flow networkRelated: It generalizes source-to-sink movement to systems without a single source or sink.

• Ford–Fulkerson algorithmRelated: Maximum-flow methods extend to feasibility and circulation through network transformations.

• Max-flow min-cut theoremRelated: Flow and cut conditions extend the theorem's reasoning to feasibility and circulation.

• Minimum-cost flow problemRelated: Adding costs to a feasible circulation gives a closely related optimization model.