Maximum Flow for a cutting-stock plan
Built for first responders planning or training for real incidents. Run fast what-if scenarios for response planning and training — no software to install in the field. Simulate a cutting-stock plan live below — adjust the inputs and watch it respond, right in your browser.
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
Governing equation
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 first responders?
- Yes — this version of "Maximum Flow for a cutting-stock plan" is framed for first responders planning or training for real incidents. Run fast what-if scenarios for response planning and training — no software to install in the field.
- Do I need to install anything?
- No. It runs in any modern browser, free, with no account required.