What is the maximum possible flow in the above graph?

The maximum possible flow in the above graph is 23. Recommended: Please solve it on “ PRACTICE ” first, before moving on to the solution. Ford-Fulkerson Algorithm The following is simple idea of Ford-Fulkerson algorithm: 1) Start with initial flow as 0. 2) While there is a augmenting path from source to sink. Add this path-flow to flow.
For More Information Please Refer:


You May Also Like to Read: