Max Flow – Min Cut Theory

Hello Readers

Hope you are doing well. Today i am here with detailed discussion on Max Flow – Min Cut problems and solutions. For application part you can refer my previous post

Network Flows: Max Flow + MinCut Theory.

Consider the following situation why Max flow is required.IMG_20180106_125510

From the above image it is clear that there may be so many solutions of possible flows but we need to find the optimum solution.

So i am attaching my further notes in which Max Flow Min Cut theorem has been discussed. I have discussed so many examples in the following notes so that you can easily understand the concept. So go through the following notes.




Hope you got understand.

If you have any query then feel free to drop them on comment box.

Thank you.

Stay Connected, Stay learnt.

Namita Tiwari

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s