Maximum Flow and Minimum Cut Workbench
Compute an exact capacity-constrained flow and inspect conservation plus an equal-capacity minimum-cut witness.
Loading tool…
How to use Maximum Flow and Minimum Cut Workbench
Breadth-first residual augmentations send flow from source to sink. Once no residual path remains, reachable vertices define a cut. Every arc capacity, intermediate-node balance and equality of flow/cut values is checked before export.
- Enter node labels json, arc json (from, to, capacity), source label, sink label.
- Choose the stated convention and check the units and supported model.
- Calculate, inspect the result, then copy or download it.
Good to know
- Exact-grid inputs are plain decimals with at most six places and magnitude≤1e9. Raw JSON number spelling is checked before conversion; decimal strings can preserve exact grid values. Exact rational intermediates are bounded to 8192 bits.2–30 vertices, 150 unique directed arcs and 10000 augmentations. Antiparallel arcs are distinct; self-loops and duplicate directed arcs are refused. Capacities share one unit. No real network control, capacity prediction or minimum-cost objective.
- Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.
Common questions
What verifies that the reported flow is maximal?
The export includes a separating cut whose total forward capacity equals the feasible conserved flow. No larger feasible flow can cross that cut under the entered capacities.
Is the input uploaded or saved?
No. The tool calculates inside this browser tab and provides a local download; it does not persist your input.
Keep going with related tools
All math →Weighted Shortest Path Workbench
Inspect a shortest-path witness and distances from one source in your own nonnegative weighted graph.
CalculatorsCost Assignment Workbench
Find an exact minimum-cost or maximum-value one-to-one assignment and export the matching witness.
CalculatorsBill of Materials Explosion Workbench
Expand multi-level product requirements through an exact acyclic component graph and inspect shared-component contributions.
DataTwo-stage Sankey Diagram Builder
Create an original quantity-proportional source-to-destination flow diagram with exact totals, complete tables and a real SVG or CSV export.
MathMinimum Spanning Forest Workbench
Connect every reachable undirected component at minimum total edge weight while preserving isolated nodes and source-edge provenance.
CalculatorsBalanced Transportation Cost Planner
Allocate integer supply to integer demand over declared routes and return a checked minimum-cost shipment matrix.