For Hobbyists & Makers · Maximum Flow
Maximum Flow for a network flow
Built for hobbyists & makers exploring it for fun. Play with real physics and math, no license and no setup — just open and tinker. Simulate a network flow live below — adjust the inputs and watch it respond, right in your browser.
Maximum FlowLive
Edmonds-Karp network flow
Controls
Presets
The max-flow problem asks how much can be pushed from a source to a sink through a network of capacity-limited edges. Edmonds-Karp repeatedly finds an augmenting path and saturates it until none remain. By the max-flow min-cut theorem, the answer equals the capacity of the cheapest set of edges that, if cut, disconnects source from sink — the bottleneck.
Data Inspector
Maximum flow18
Nodes6
Bottleneckmin cut
Governing equation
Reading this result: Both feed edges are generous, so the bottleneck has moved to the fixed interior capacities — adding more feed capacity no longer raises the max flow (min-cut theorem).
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
More with Maximum Flow
Frequently asked questions
- Is this good for hobbyists & makers?
- Yes — this version of "Maximum Flow for a network flow" is framed for hobbyists & makers exploring it for fun. Play with real physics and math, no license and no setup — just open and tinker.
- Do I need to install anything?
- No. It runs in any modern browser, free, with no account required.