Question

What are the steps in solving network flow problem using ford fulkerson algorithm ?

Answer 1

Answer:

Theorem (Max-flow min-cut Theorem): The value of a maximum (s,t)-flow equals the smallest possible value of an (s,t)-cut. This means that if you can find an (s,t)-cut with a value that equals the current value of the (s,t)-flow, then the flow is definitely maximum.