Back to Discover
🔢

Push–relabel maximum flow algorithm

math Maturity 7-9

We can move things through a path.

Push-Relabel Algorithm Example - Step 1.svg
Push-Relabel Algorithm Example - Step 1.svg
We push things to new spots. We change the height to help. This helps us find the best way. It is a very fast way to work. Can you find a path?

45 words
🖼️ Images & Media (9)
File:Push-Relabel Algorithm Example - Step 1.svg
Push-Relabel Algorithm Example - Step 1.svg
File:Push-Relabel Algorithm Example - Step 2.svg
Push-Relabel Algorithm Example - Step 2.svg
File:Push-Relabel Algorithm Example - Step 3.svg
Push-Relabel Algorithm Example - Step 3.svg
File:Push-Relabel Algorithm Example - Step 4.svg
Push-Relabel Algorithm Example - Step 4.svg
File:Push-Relabel Algorithm Example - Step 5.svg
Push-Relabel Algorithm Example - Step 5.svg
File:Push-Relabel Algorithm Example - Step 6.svg
Push-Relabel Algorithm Example - Step 6.svg
File:Push-Relabel Algorithm Example - Step 7.svg
Push-Relabel Algorithm Example - Step 7.svg
File:Push-Relabel Algorithm Example - Step 8.svg
Push-Relabel Algorithm Example - Step 8.svg
File:Push-Relabel Algorithm Example - Step 9.svg
Push-Relabel Algorithm Example - Step 9.svg
Up Next
🔢
Ford–Fulkerson algorithm
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Ford–Fulkerson algorithm 0% Maximum flow problem 0% Hungarian algorithm 0% Minimum-cost flow problem 0% Bellman–Ford algorithm 0% Dijkstra's algorithm 0%

🔬 Go deeper

More advanced topics to explore

Minimum-cost flow problem Dijkstra's algorithm Maximum-cardinality matching Ellipsoid method

🪜 Step back

Simpler topics to build understanding

Ford–Fulkerson algorithm Maximum flow problem Hungarian algorithm Bellman–Ford algorithm
📚 Content adapted from Wikipedia | Readability: FK 11.8 | Vital Level 5