Maximum Flow and Minimum Cut of a Network

[@naeemult]

Thanks, this helped a lot! What a shortcut haha

[@saatvik6409]

Thnx a lot.... beautifully explained ❤

[@chiragrathi7445]

thank you :)

[@saiaditya5763]

hi thanks for the explanation i got a doubt what will be the vertices for minimum cut ?? two set of vertices ??

[@Samj02]

If there are duplicate numbers along a path, for example two 6s, do you cross both out and add both of them at the end or just add one 6?

[@chinmaysworld2065]

What do u think

[@kiranboddeda4121]

Hi, your third cut in the 2nd example is wrong becuase the flow is flowing from below to above whih shouldn't be considered. Always from above to below. If I am wrong please correct!

[@EmDickinson]

Hi Kiran, we always count edges that flow from the side of the source to the side of the sink, not "above" or "below".

[@chinmaysworld2065]

According to your views your subscribers are soooooooooo less

[@EmDickinson]

chinmay's world I didn’t upload any videos for 6 years so it’s not surprising!

[@rahulbhatia1313]

@@EmDickinson because of lockdown?

[@EmDickinson]

Rahul Bhatia I’m uploading now because I’m teaching my students online.

[@chinmaysworld2065]

@@rahulbhatia1313 bhai karde subscribe

[@markpascual100]

@@EmDickinson glad to see that you're back :) from high school to uni i have seen your videos!