> Textbooks could do 10 times of a better job than I could ever do. Textbooks could stretch out what you described in this video to be 300 pages. This is beautiful and is more than I learned from a week of Algorithms. Thank you!
Happy Holidays 🎉 Thank you for this beautiful comment, tvishathakur! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
You already have achieved the minumum cut..Cause you(source) are clearly trying to maximize the amount of flow of knowledge that can reach us(sink).. Well done bro..
This was really helpful! I'm studying to be a data engineering and we talk a lot about graphs so your videos really help. You are very clear and explain things in a very visual way which helps a lot. Thank you so much!
DUDE. I am still really early on in your videos but just wanted to come to your latest video and say.Your videos are incredible they are such an enormous help. The amount of research and thought you put into each video Is very clear in how well you explain all of the concepts you cover. Thank you very much for all your hard work. I appreciate it and godspeed brother wishing you all the best in your career and studies.
Thank you for explaining why we can traverse backwards edges when finding an augmented path. Most other resources seem to gloss over this when it's the trickiest part of the algo!
Hey man, thank you for your interview preparation videos. I have got a very good job offer from a startup in India, and your videos played a substantial role in building up my understanding of concepts during interview preparation. Thank you for explaining things so elegantly!
Great. It really helps seeing a fellow human being gesticulating and talking and drawing. I never thought about it, but it really helps binding my attention. Thanks, my dude.
Great Tutorial man. It saved me the pain of reading a whole paper. Thanks. This is a really good explanation. One can go back and code without much of a problem.
Thanks so much for this channel dude. Your videos on backtracking and sorting were absolutely key to my technical interviews at Amazon this past week. Ended up getting an offer, cheers mate.
@@BackToBackSWE So as far as i understand the min cut (S,T) is an indication/bottleneck for the maximum flow we can push if all outgoing edges of the S part become saturated,right?
god bless you, i was trying to understand an exercices and just by saying it's like water pipe everything was so clear ! i wasn't thinking i can understand so fast with just a trivial comparaison xD But anyway thanks ! you're the best :)
Thank you so much, I finally understood what was happening there. I read the book, not only consumes a lot of time but it can be tricky to understand. You helped me finally clearing up any question I had.
Happy Holidays 🎉 Thank you for your kind words, Anto-y! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
So clear! Thank you! I find the textbook stuff is so bogged down with notation that I have a hard time seeing the intuitions. You made it crystal clear!
Isn't the idea of the min-cut just that it is the bottle neck between s and t? Hence, pushing flow from s to t will be capped by the min-cut edges, therefore their value tells you the max-flow through the network. At least that is my intuitive takeaway from this :)
This is amazing, thank you so much for explaining what the residual graph actually means. I've studied the proof but never understood it fully until now.
Thanks a lot for all your videos. Could you please upload some more videos on greedy problems and about the approach to solve them. for ex the gas station problem in Leetcode.
Great explanation. Just a note Ford Fulkerson, it is not an algorithm but rather a method as it has multiple possible implementations with different run times
Yeah I know you (have seen you commenting a couple times before) although not sure if we've met in real life. And I do not, and yes Leetcode is thin on that as of now
hey man.. can u probably make a video about how to go about thinking when u are solving any coding questions? like what should be the thought process? so that we can come up with optimized solutions.. it would be a great help
Hey man..a small video suggestion..if possible can you make a video on..how your brain processes when you see a problem..decide this method to approach..like breakdown your method of approaching a problem..or like take an unsolved problem solve it live..this can help us know how to think to approach and solve a problem..like some framework or steps that you have for backtracking..make a generalized framework for every topic and problem approaching..!! Just a suggestion...!!✌️ Edit : Example:: check out Anton Spraul's Think Like A Programmer playlist something like that..but in your point of view..!
Just a question, while making these videos do you only learn enough to make this video or do you go and check the proofs and understand them deeply? I am asking because I want to use that as a standard while reading or learning about some new concept on wikipedia etc in future.
I'm in a class for algorithm design and it is all proof centric. I just made this to cover the surface level concepts and to help teach myself as well.
The author is correct, is taking into account only the forward edges .The capacity of the cut is the sum of the capacities of forward edges -- it represents the maximum flow which can be pushed through that cut.
Please a qustion, can we hav more than one min cut in a network flow? Bcs from what i did i get 2 min cuts cuz when i sum both gives me the max flow value i got.
Ben your stuff is also helpful for senior devs(like myself). I’ve just landed a job at Amazon SA CPT. Thank you young man. Continue doing what you do.
Congrats, happy for you
> Textbooks could do 10 times of a better job than I could ever do.
Textbooks could stretch out what you described in this video to be 300 pages. This is beautiful and is more than I learned from a week of Algorithms. Thank you!
This 20 min video was more clear than a whole chapter of a book or any other lecture! Thanks for this beautiful explanation :D
Happy Holidays 🎉 Thank you for this beautiful comment, tvishathakur! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
super super succinct, straightaway, something that professors lack is the ability to articulate and give ways to teach students more obviously.
You already have achieved the minumum cut..Cause you(source) are clearly trying to maximize the amount of flow of knowledge that can reach us(sink)..
Well done bro..
well put
There aren't enough good words in the world to describe my gratitude towards you and the videos you make!
May the internet grow big and strong
This is literally the best video I've seen for explaining the min-cut problem.
This is so helpful! I memorized Ford-Fulkerson algorithm but never got an intuitive understanding until I saw this video. Thanks!
nice
First year Computational Science student here. Thanks a lot for your videos, man. They're really helping me for my Data Structures & Algorithms class
Big Thanks from a novice com-sci student here! I couldn't follow this in class but you explained everything clearly!
Happy to help!
This is actually the best source out there which simplifies and explains properly!
i agree :)
This was really helpful! I'm studying to be a data engineering and we talk a lot about graphs so your videos really help. You are very clear and explain things in a very visual way which helps a lot. Thank you so much!
Watched like several videos on this topic, and this video by far the most clear and concise.
nice
DUDE. I am still really early on in your videos but just wanted to come to your latest video and say.Your videos are incredible they are such an enormous help. The amount of research and thought you put into each video Is very clear in how well you explain all of the concepts you cover. Thank you very much for all your hard work. I appreciate it and godspeed brother wishing you all the best in your career and studies.
thanks
Thank you for explaining why we can traverse backwards edges when finding an augmented path. Most other resources seem to gloss over this when it's the trickiest part of the algo!
yeah
I'd like to thank you cause I didn't understand anything my professor told us in class, and his slide were also a mistery until I saw your video.
nice
Are you also in Asif Salekin's class?
@@orderkare7907 ?
The choice of example was perfect. Simple but complex enough to illustrate the need for backflow. Great video for the intuition.
ye
Hey man, thank you for your interview preparation videos. I have got a very good job offer from a startup in India, and your videos played a substantial role in building up my understanding of concepts during interview preparation. Thank you for explaining things so elegantly!
sure, good luck!
Great. It really helps seeing a fellow human being gesticulating and talking and drawing. I never thought about it, but it really helps binding my attention. Thanks, my dude.
Your ability to transmit information in a clear and complete way is golden.
Thank you 🎉 Please enjoy a special coupon from us - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=SUB 🚀
5 mins in and I’m subbed. These videos are true gems. Thank you very much
ur a gem
Great Tutorial man. It saved me the pain of reading a whole paper. Thanks. This is a really good explanation. One can go back and code without much of a problem.
ye
Many thanks from graduate students at the Faculty of Electrical Engineering and Computing, Zagreb, Croatia!
Amazing video!
Found your video literally a day before my exams. Thanks heaps
yo
Mathematical engineering student here! Thanks man, this is helping me with my OR exam!
nice
Dude, best explanation ever. I tried looking at 4 different videos, yours is the best.
Operations Research student here , thanks Ben !
Sure yo
"S-T cut, S must be in A and T must be in B" exactly what I was searching for, most memorable. Thanks
Check out the free DSA Mini-Course 👉backtobackswe.com/five-day
Table of Contents:
Defining The Flow Network 0:00 - 3:35
Greedily Pushing Flow 3:35 - 5:16
Recovering From The Greedy Choice 5:16 - 8:01
The Residual Graph 8:01 - 15:36
Ford-Fulkerson Algorithm (Overview) 15:36 - 17:42
Max-Flow Min-Cut 17:42 - 21:55
Thanks so much for this channel dude. Your videos on backtracking and sorting were absolutely key to my technical interviews at Amazon this past week. Ended up getting an offer, cheers mate.
Nice!
@@BackToBackSWE So as far as i understand the min cut (S,T) is an indication/bottleneck for the maximum flow we can push if all outgoing edges of the S part become saturated,right?
@@BackToBackSWE What purpose does a cut serve ?
Glad I couldn’t find any German videos on this topic, this is great!
German videos?
Thank you man you explained better than houndreds and hundreds of text books. Let me say it once more, Thanks a lot for this video again 🙏🏻
god bless you, i was trying to understand an exercices and just by saying it's like water pipe everything was so clear ! i wasn't thinking i can understand so fast with just a trivial comparaison xD
But anyway thanks ! you're the best :)
Really love the word "undo". It help me understand what the hell there's an reverse arrows in this algo
Thank you for your help, I'm currently studying in year 12 in Australia and this is really helpful, Thank You!!!
Thank you so much, I finally understood what was happening there. I read the book, not only consumes a lot of time but it can be tricky to understand. You helped me finally clearing up any question I had.
Happy Holidays 🎉 Thank you for your kind words, Anto-y! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
perfect. thanks so much.. spent hours watching lectures and this one vid helped me more than all of them combined!!!!
God, thank you so much for this video. I was pulling my hair out reviewing some modules before my upcoming final. This clarified things so much!!
Amazing! My university professor recommended your videos last week in class🤗 Could you also explain when you have time the Bellman Ford algorithm?
Yeah possibly
Which UNIVERSITY?
@@PankajKP LPU
Amazing Explanation! You have some great communication skills for a topic that is definitely not the easiest
thanks
This made it easier to understand the Ford-Fulkerson Algorithm iterations on a graph.Thanks😁
So clear! Thank you! I find the textbook stuff is so bogged down with notation that I have a hard time seeing the intuitions. You made it crystal clear!
Glad it was helpful!
someone get this man a medal
Bro you are genius. You saved my time.
THANKS a ton! You're explanation of max-flow min cut was so valuable, better than my course lectures.
Really well explained the intuition. Exactly what I was looking for!
great.
Isn't the idea of the min-cut just that it is the bottle neck between s and t? Hence, pushing flow from s to t will be capped by the min-cut edges, therefore their value tells you the max-flow through the network. At least that is my intuitive takeaway from this :)
Awesome explanation bro!!! Just Watched till 5:47 but felt amazing man!.
ye
This is amazing, thank you so much for explaining what the residual graph actually means. I've studied the proof but never understood it fully until now.
So glad I found your channel!! Your explanations are so clear :)
Welcome to the channel.
20:45 Can't we cut from in front of U for the minimum cut that will be 2+1 = 3?
graph is changed by then.....it is not the initial one ....now it is 4+3 = 7
20:35 why the heck do you not count the edge weighted 2?
wow, it's so clear and intuitive. Thanks a lot. It helps me to understand more after diving complicated concepts in textbook.
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
Thank you so much, you made this so much more understandable than my instructor
my man Ben doing God's work! Thank you so much!
hello
Well can i think of the back edges as kind of an U-TURN ?
literally one of the best explainations
Best explanation.....
Love from India🇮🇳
thx.
This video was fantastic, I needed a visualization badly. Thank you so much
Great job in explaining the reason why the undo operations work!!
sure
great explanation. no stutter.no bullshit. just good solid well explained!
thank you
thx
Please continue to do this series of lectures!!! You are way better than my teacher in college.
Your "undo" gives me the epiphany! Thank you!
Thanks a lot for all your videos. Could you please upload some more videos on greedy problems and about the approach to solve them. for ex the gas station problem in Leetcode.
ok
Great explanation. Just a note Ford Fulkerson, it is not an algorithm but rather a method as it has multiple possible implementations with different run times
en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm 😳😳
@@BackToBackSWE okokok so it's just a matter of how strict you are before it is not categorized as an algorithm :D
thanks for your video it help me to understand maxflow -mincut more directly
nice
i don't know what to say but this vid saved me ... thx a lot
u saved
This has helped me so much for me exam. Thank you so much.
Thank you so much for this video, I've been struggling to understand this for awhile.. Buh now I get it..
i passed my algorithms class bc of u
Hey man, that was really really helpful. Thank you so much for the awesome explanation.
sure
What does it mean by "counting edges going out of the cut". How we become sure about the direction.
this was amazing
Thanks 🙏🏻
Your way of explaining is perfect
Fellow terp here. Do you have any tips on tackling system design problems during interviews? I feel like leetcode doesn't really have much on those.
Yeah I know you (have seen you commenting a couple times before) although not sure if we've met in real life. And I do not, and yes Leetcode is thin on that as of now
Thank you!! You make it so simple. Keep on, it's great!!
I never understood that back edges concept until i saw this one.
best lecture i ve found so far, thanks!
thanks, was so much easier to understand after i watched the video
Thank you, appreciate it 😄 Also check out our Free 5 Day DSA Interview Prep Mini-Course - backtobackswe.com/ 🎉
hey man.. can u probably make a video about how to go about thinking when u are solving any coding questions? like what should be the thought process? so that we can come up with optimized solutions.. it would be a great help
I cannot right now
Best video on this subject! Thank you!
You're videos are amazing! Keep it up
ok
Finally an explanation that makes sense to me.
Thank you! Brilliant explanation, so easy and clear!
thanks
Hey man..a small video suggestion..if possible can you make a video on..how your brain processes when you see a problem..decide this method to approach..like breakdown your method of approaching a problem..or like take an unsolved problem solve it live..this can help us know how to think to approach and solve a problem..like some framework or steps that you have for backtracking..make a generalized framework for every topic and problem approaching..!! Just a suggestion...!!✌️
Edit : Example:: check out Anton Spraul's Think Like A Programmer playlist something like that..but in your point of view..!
Yes
Thank you for making this great video! :) It's helping me with my graph algorithms course.
Just a question, while making these videos do you only learn enough to make this video or do you go and check the proofs and understand them deeply? I am asking because I want to use that as a standard while reading or learning about some new concept on wikipedia etc in future.
I'm in a class for algorithm design and it is all proof centric. I just made this to cover the surface level concepts and to help teach myself as well.
Well done, that was a big help. Thanks!
Thanks for explaining this. You have good teaching skills.
Thanks
thank you so much you made it very clear to understand.
Saved me from failing ahaha
thanks and that's great
Hi Ben, Great work! These videos are so helpful for interview preparation. Can you make a video to go over Union-Find data structure ?
Yes I can, just time limits my ability to contribute here.
Why would you count 2 for the cut when you slice the 1,2,3 edges but with the 4,2,3 you won’t count the 2v
you made such a nice video but it's so hard to follow with the residual/original corrections, at some points I wasn't sure anymore what you mean..
Fantastic video. Beautiful work.
you mentioned we only take the edges going out of the cuts but at 20:17 you take into account the edge from U to V and at 20:31 you dont ?
I haven't replied to this for a bit, replying to close this out in my "unresponded to comments" feed.
The author is correct, is taking into account only the forward edges .The capacity of the cut is the sum of the capacities of forward edges -- it represents the maximum flow which can be pushed through that cut.
Please a qustion, can we hav more than one min cut in a network flow? Bcs from what i did i get 2 min cuts cuz when i sum both gives me the max flow value i got.
Can you plz suggest a good text book for this....I was using Douglas West....what's your choice
Great video , thanks. Love all your videos. Can you please make a video on 647 Approach #2: Manacher's Algorithm
ye
Please make a video on graph articulation points and bridges. There are not many good videos out there on this topic.
ok
Great stuff! Really helped me understand these concepts!
Wow really clear and good video! Thanks!
ye
Well done! Thank you very much for your work putting together this helpful video