Click the above network to solve the max flow problem. The figure below is a residue network.

SEE ALSO

- Other examples of Ford-Fulkerson's Algorithm
- Shortest Path by Dijkstra's Algorithm
- Minimum Spanning Tree by Prim's Algorithm
- Minimum Spanning Tree by Kruskal's Algorithm