Maximum flow Minimum Cut Algorithm

There are videos for:
Queensland: General Mathematics
Queensland: Mathematical Methods
Queensland: Mathematics Specialist

Western Australia: Mathematics Applications
Western Australia: Mathematics Methods
Western Australia: Mathematics Specialist

[amandabrown]

The "water through the driver side" explanation really helped me understand which paths should and shouldn't be counted. Thanks!

[vivianoranges]

When they taught networks at school, I missed the topic and I have my HSC (NSW) standard/general maths exam in a week so this really saved me. It's a bit tedious, but going through each cut one by one visually to find the minimum definitely helped clarify my understanding! Massive thanks😭

[DD-uhto]

i need you to know that youre saving my life right now thank you so much

[jdcasanasr]

I love how creative you are with examples. Congrats mate!

[liv]

best explanation i've seen for this topic so far

[gokulvellingiri]

Great one. I am so impressed with your driver and passenger concept.

[zippykat]

I was wondering if there is any way to know if you have gotten all the cuts? For spanning trees you can see that the number of edges is equal to the number of vertices, minus 1. Is there some rule for cuts too?

[pradeexsu]

Thanks joel 😊 i really love the way you explain the concept. Thank you so much ❤️🙏 for amazing explanation.

[jordiespinafont]

Thank you so much for good videos, it is so helpful to get clear and step by step explanations on concepts. Really appreciate your teaching!

I was wandering if there is a last cut that can be made: Starting from E(A, C) -> E(C, D) -> E(D, E) -> E(D, B) -> E(A, B)

[ihaveskillissue]

Got confused when you were talking about driver's side and passenger side, then I realized you are Australian! Regardless amazing video! Cheers from the States.

[yashkumarkandoi]

Amazing explanation. Understood in one go!

[theCRGlife]

Awesome Video, Really Informative.





Commenting for YouTube Algorithm

[imtiredgoodnight]

Great video and channel, very well explained.

[rubenmatton]

I'm wondering how do they make these kind of videos where there is an invisible board

[aybuke]

Hello thanks for video. But I didn't understand why you ignored "5". I think c5 should be 1+3+5+3 ?Am I wrong?

[allgood]

Good job helped me get good mark, very good explanation 👍

[stanley]

If the start pipe is on the right and the sink is on the left is it better to re-draw the pipe network from left to right and then do the algorithm? Or would it be better to just do the algorithm and switch the drivers side.

Thanks for the video by the way! 👍

[Jmart]

Great video, but isn't there an 8th cut hat goes through AC, CD, DE, DB, AB?

[michaelklaczynski]

Okay, but how do you do this on a 1000-node, fully connected graph?

[humza_shah]

Awesome video! I found another cut that you missed. The cut that represents the partition of the nodes {A, D}. So drive up through A-C. Then turn right through C-D. Then up through D-E. Then left through B-D. Finally, up through A-B. This still cuts A off from E completely since the car goes from the bottom all the way to the top. The way I think about cuts for network flow problems is partitioning nodes into every possible subset of nodes (always including A and excluding E). So we have {A}, {A, B}, {A, C}, {A, D}, {A, B, C}, {A, B, D}, {A, C, D} and {A, B, C, D} thus 8 cuts in total. To connect with your cuts. c1 = {A}, c2 = {A, B}, c3 = {A, B, D}, c4= {A, C}, c5 = {A, B, C}, c6 = {A, B, C, D} and c7 = {A, C, D}. The only one we are missing is {A, D}. Thankfully, since {A, D} = 11+5+5+8 the min-cut/max-flow solution is still correct but I thought it might be worth pointing out to help with not missing any cuts! Hope this helps anyone to have a systematic way in finding and not missing any cuts.