Network maximum flow
Find network maximum flow, the source-side minimum cut and flows for each authored directed edge.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
Residual augmentation; max flow=min cut
The default network has maximum flow 7; the source side of the minimum cut contains S and A. Edge flows in input order are 4, 3, 4, 3.
At most 30 nodes and 100 edges; capacities are integers 0–1000000. A maximum-flow allocation need not be unique; residual paths are searched in input order.
Frequently asked questions
How are parallel maximum-flow edges handled?
Parallel and antiparallel edges remain separate. Each input edge row reports capacity and flow; self-loop flow is 0.
What does the source side of the minimum cut mean?
It is the set reachable from the source through residual edges when no more flow can be added.
Calculation criteria and reference materials
- Princeton Algorithms: Maximum Flow
Residual augmentation; max flow=min cut
Verification of calculation criteria: · Calculation·verification principles · Report errors