Back to Discover
🔢

Flow network

math Maturity 11-13

Things move from one place to another.

Network Flow Cropped2 - revised.png
Network Flow Cropped2 - revised.png
Water moves through pipes. Cars move on roads. We must not send too much at once. What can you move through a path?

35 words
🖼️ Images & Media (3)
File:Network Flow Cropped2 - revised.png
Network Flow Cropped2 - revised.png
File:Flow decomposition.svg
Flow decomposition.svg
File:Network flow residual PNG.png
Network flow residual PNG.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% Maximum flow problem 0% Connectivity (graph theory) 0% Directed acyclic graph 0% Minimum-cost flow problem 0% Ford–Fulkerson algorithm 0%

🔬 Go deeper

More advanced topics to explore

Max-flow min-cut theorem Connectivity (graph theory) Directed acyclic graph Minimum-cost flow problem

🪜 Step back

Simpler topics to build understanding

Maximum flow problem Ford–Fulkerson algorithm Graph (discrete mathematics) Degree (graph theory)
📚 Content adapted from Wikipedia | Readability: FK 11.4 | Vital Level 5