Back to Discover
🔢

Ford–Fulkerson algorithm

math Maturity 7-9

We can find the best way to move things.

Ford-Fulkerson example 0.svg
Ford-Fulkerson example 0.svg
Imagine water moving through pipes. We look for paths that have room. We fill each path with as much as we can. We do this until no more room is left. This helps us move the most stuff. Can you find a path?

55 words
🖼️ Images & Media (5)
File:Ford-Fulkerson example 0.svg
Ford-Fulkerson example 0.svg
File:Ford-Fulkerson example 1.svg
Ford-Fulkerson example 1.svg
File:Ford-Fulkerson example 2.svg
Ford-Fulkerson example 2.svg
File:Ford-Fulkerson example final.svg
Ford-Fulkerson example final.svg
File:Ford-Fulkerson forever.svg
Ford-Fulkerson forever.svg
Up Next
🔢
Push–relabel maximum flow algorithm
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Push–relabel maximum flow algorithm 0% Maximum flow problem 0% Flow network 0% Hungarian algorithm 0% Max-flow min-cut theorem 0% Maximum-cardinality matching 0%

🔬 Go deeper

More advanced topics to explore

Push–relabel maximum flow algorithm Maximum flow problem Flow network Hungarian algorithm

🪜 Step back

Simpler topics to build understanding

Queue (abstract data type) Turing degree Five lemma Maze
📚 Content adapted from Wikipedia | Readability: FK 9.6 | Vital Level 5