CODEWITHSUNDEEP
algorithmgraph-theory
user435845
user435845

Reputation: 1

Graph Theory/Algorithm: Do multiple max flow imply multiple min cut?

We know that Ford-Fulkerson Algorithm (FFA) will yield max flow and min cut solutions at the same time. My question is: if restricted to integer graph only, does the existence of multiple max flow paths imply the existence of multiple min cut paths?

My approach is that if we know that FFA can help us find different max flow paths, then we know that the different corresponding min cuts could be found. But how do we know whether FFA can find different max flow paths?

Thanks in advance!

Upvotes: 0

Views: 1494

Answers (1)

Yola
Yola

Reputation: 19041

In this graph, we have to different integer max flows, but only one min cut:

enter image description here

Upvotes: 3

Related Questions