Back to Discover
🔢

Maximum flow problem

math Maturity 11-13

We can move things from one place to another.

Simpe flow network.svg
Simpe flow network.svg
Imagine water moving through pipes. Some pipes are big. Some pipes are small. We want to move as much as we can. This helps us plan things like trains. Can you think of things that move in lines?
Pets flow.svg
Pets flow.svg

50 words
🖼️ Images & Media (9)
File:Pets flow.svg
Pets flow.svg
File:Simpe_flow_network.svg
Simpe_flow_network.svg
File:Multi-source multi-sink flow problem.svg
Multi-source multi-sink flow problem.svg
File:Maximum bipartite matching to max flow.svg
Maximum bipartite matching to max flow.svg
File:Node splitting.svg
Node splitting.svg
File:Baseball Elimination Problem.png
Baseball Elimination Problem.png
File:Maxflow imagesegmentation image.png
Maxflow imagesegmentation image.png
File:Maxflow imagesegmentation network.png
Maxflow imagesegmentation network.png
File:Maxflow imagesegmentation result.png
Maxflow imagesegmentation result.png
Up Next
🔢
Max-flow min-cut theorem
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Max-flow min-cut theorem 0% Flow network 0% Ford–Fulkerson algorithm 0% Maximum-cardinality matching 0% Minimum-cost flow problem 0% Push–relabel maximum flow algorithm 0%

🔬 Go deeper

More advanced topics to explore

Max-flow min-cut theorem Flow network Maximum-cardinality matching Minimum-cost flow problem

🪜 Step back

Simpler topics to build understanding

Ford–Fulkerson algorithm Hungarian algorithm Edge cover Zorn's lemma
📚 Content adapted from Wikipedia | Readability: FK 11.0 | Vital Level 5