Aren't you supposed to draw a backward edge and give it capacity c when you reduce the remaining capacity of an original edge by c? If you don't do that, I think you can miss some possibilities to push more water from the source to the sink.
@EmDickinson I think that such a shortcut will work 100% of the time if you make good choices at all the steps. The idea behind drawing backward edges seems to be that, by doing that, all bad choices will eventually be corrected. Do you agree?
@@AA-le9ls There have been a few occasions where the shortcut has not given the max flow, but if you start again and choose a different order of paths then it works. It tends not to work if you have any edges that cross over. It happens very rarely, but it does happen.
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!
Thanks, this helped a lot! What a shortcut haha
Thnx a lot.... beautifully explained ❤
thank you :)
hi thanks for the explanation i got a doubt what will be the vertices for minimum cut ?? two set of vertices ??
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?
What do u think
Aren't you supposed to draw a backward edge and give it capacity c when you reduce the remaining capacity of an original edge by c? If you don't do that, I think you can miss some possibilities to push more water from the source to the sink.
Yes, that's the how the actual algorithm works but that it too complex for many of my students so this is just a shortcut that works 99% of the time.
@EmDickinson I think that such a shortcut will work 100% of the time if you make good choices at all the steps. The idea behind drawing backward edges seems to be that, by doing that, all bad choices will eventually be corrected. Do you agree?
@@AA-le9ls There have been a few occasions where the shortcut has not given the max flow, but if you start again and choose a different order of paths then it works. It tends not to work if you have any edges that cross over. It happens very rarely, but it does happen.
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!
Hi Kiran, we always count edges that flow from the side of the source to the side of the sink, not "above" or "below".
According to your views your subscribers are soooooooooo less
chinmay's world I didn’t upload any videos for 6 years so it’s not surprising!
@@EmDickinson because of lockdown?
Rahul Bhatia I’m uploading now because I’m teaching my students online.
@@rahulbhatia1313 bhai karde subscribe
@@EmDickinson glad to see that you're back :) from high school to uni i have seen your videos!