There's sth called "redoublement". That's French. Don't be decieved. it's not that the two weeks of university lectures didn't have any effect on you. Think this through dude. :)
The teachers know the material very well, but they don't understand it, so they don't teach their students to understand it, the class just throw students in a meatgrinder that tests them on whether they "know" it.
I'm trying to catch up with the current semester in businessengineering and your video helped me get through ~ 50 pages of lecture in no time. Big thanks from Germany
I literally watched a million lectures and spent so much time trying to understand this residual graph thing, and you just explained it in 5 minutes. Thank you, you are doing the Lord's work
As well as his rules about equillibrium and making sure to update the flow by the value of the bottleneck. Remember these two hard and fast rules. 1. You can only go Forward (in the correct direction of a path) if the path has FLOW TO ADD e.g 8/10 still has 2 more to add so you can use it but 4/4 is capped. 2. You can only go Backward (in the opposite direction of a path) if the path has FLOW TO GIVE e.g 6/8 has 6 to give but you can't go backwards on 0/4 because it has 0 flow to subtract.
He have implemented the Naive Greedy Algorithm Approach (May not produce optimal or correct result) and not the Ford-Fulkerson algorithm. See the details on the link: www.geeksforgeeks.org/max-flow-problem-introduction/. The Ford-Fulkerson algorithm uses the residual graph concept, see more details on the link: www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/.
God bless you best wishes for you I used you videos before my exam and could pass it in the best way. your 5 minutes videos are more efficient than a whole lecture in collage ❤❤❤❤
Bro I watched so many videos on how to do this and still could not figure it out. Not sure what yours did differently, but I'm not gonna overthink it, thank you man!!
I first watched your video, got most of it but still couldn't wrap my head around it so watched a few other videos and came back to it and watched again to get a full understanding. Thank you.
Wow, finally someone who actually understands how to meaningfully communicate ideas to other people (what's that word called... "teaching"? But I thought that's what my university was supposed to do? hmmm........)
Thank you for these videos, I'm currently studying for algorithms & data structures exam and you are very clear in explaining how these algorithms work!
this is an important algorithm where many other people explain it may go into detail and thus confused me. I looked for, like, 6~7 video explaining this algorithm, you are the best.
Nice video. Thank you! Had been taught with using the residual graph and moving arrows. The idea of just using forward edges that are full or backward edges that are empty is so much easier to understand.
I'm so lucky to find this video, thanks a lot! Positive comment: clear voice and clear visualization, make your explanation easy to follow. Negative comment: nothing.
i love you man this is the first of your videos i watched but it wont be the last. i learned more in 5 min here than i did in 100 mins in the lecture last week.
Your videos are really good for introducing the concepts used in algorithms! Watching this together with videos from e.g. Abdul Bari is what is getting me through this AlgDat-course.
You had Ford Fulkerson for 14 weeks? We discussed this in like what... 30 minutes? + residual networks and the actual algorithm are missing here. Good video for what it's set out to do, no doubt, but 14 weeks..? lol
Finding the Min-Cut confirms your result, which passes thru Edges: SA, AC, CD. Using an S-T cut, where S is in area A and T is in area B and directed edge starts in A and ends in B. Thanks
we just had exactly that in the lecture just now from 8am- 1pm.... and in no way was my question i had answered ..... (why not choose A-C ) you clarified that for me .... thanks i hope it helps me to manage tomorrows test :)
I got the total capacity with 20 , with the following paths : S -> A -> D -> T = 8 S -> C -> D -> T = 2 S -> C -> D -> B -> T = 6 S -> A -> B -> T = 2 S -> C -> D -> A -> B -> T = 2 Total = 20 , with 7 saturated edges .
for people looking at it and having a bipartite graph where an edge is either 0/1, you don't need to calculate bottlenecks, you just repeatedly trace a possible path.
I was going to check the sources for this video to mention them in my homework, only to find out you studied at TUe as well xdxd, I dont know why but I found that extremely funny. How small the world is
It was my first semester in master program. The course was CS6363 Design and Analysis of Algorithms. I probably failed and wouldn’t want to check my final grade. Really bad. I def will work hard next semester.
A little contradiction in my algorithms class - professor mentioned running time is O(m * n * C) and BREADTH first search is used to find augmenting paths...found this difference interesting...I guess its not the focus of this video though. He was saying we should be using breadth first search because we are interested in the shortest possible paths.
it is random. The only difference between going in a certain sequence rather than another sequence is it may take more iterations for some (the while loop doesn't care). But this algorithm always gets the MAX FLOW, which is what we need. The reason it never 'gets stuck' is with the use of backwards edges which allows you to essentially 'backtrack' when the edges get clogged up.
It was six weeks for me of university lectures. Please somethings on Warshall Floyd and Simple way to depict Euler proofs. Thank you for this video. Thank you very much
This 5 min video made more sense than 2 weeks of university lectures
+Chris Dobson in my case it made sense, whereas the two hour class I had about the subject, didn't.
There's sth called "redoublement". That's French. Don't be decieved. it's not that the two weeks of university lectures didn't have any effect on you. Think this through dude. :)
^ That explanation is so goddamn true!
The teachers know the material very well, but they don't understand it, so they don't teach their students to understand it, the class just throw students in a meatgrinder that tests them on whether they "know" it.
yep indeed xD
I'm trying to catch up with the current semester in businessengineering and your video helped me get through ~ 50 pages of lecture in no time. Big thanks from Germany
whats is business engineering? Isn't that just business?
Thats the name for industrial engineering in German@@allanjoseph3164
50 pages on ford fulkerson is crazy
@@allanjoseph3164 Engineering lite for people who can't do engineering but have too much pride to just study BA
I literally watched a million lectures and spent so much time trying to understand this residual graph thing, and you just explained it in 5 minutes. Thank you, you are doing the Lord's work
As well as his rules about equillibrium and making sure to update the flow by the value of the bottleneck. Remember these two hard and fast rules.
1. You can only go Forward (in the correct direction of a path) if the path has FLOW TO ADD e.g 8/10 still has 2 more to add so you can use it but 4/4 is capped.
2. You can only go Backward (in the opposite direction of a path) if the path has FLOW TO GIVE e.g 6/8 has 6 to give but you can't go backwards on 0/4 because it has 0 flow to subtract.
if it has 4/4 can i go back to make it 0/4? or how about 2/4 to make it 0/4?
@@dingdongskie sure you can but only if the arrow goes the opposite way from where you need to go
Thank you
Godsend, thank you
That's what he meant by "non full" forward path and "non empty" backward path but yeah
i watched almost 10 videos of this algorithm, but only your one made me understand everything. Especially of the backward edge.
Nice !
Tried doing this by hand and then watched this video. I have no words to describe how much work you saved me
Why can't everyone be so concise? Well then we wont be able to appreciate your videos. Great effort and keep up the good work
so many classes, books, slides and useless material that can't explain this better than you. thanks !!
my god you are amazing please please make more videos your clarity is beyond words
+Lindel L Working on some now. Thanks for the support!
+Michael Sambol :))))) keep up the work man! this definietly gona help me pass an exam tommorow lol
He have implemented the Naive Greedy Algorithm Approach (May not produce optimal or correct result) and not the Ford-Fulkerson algorithm. See the details on the link: www.geeksforgeeks.org/max-flow-problem-introduction/. The Ford-Fulkerson algorithm uses the residual graph concept, see more details on the link: www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/.
God bless you
best wishes for you
I used you videos before my exam and could pass it in the best way.
your 5 minutes videos are more efficient than a whole lecture in collage ❤❤❤❤
Bro I watched so many videos on how to do this and still could not figure it out. Not sure what yours did differently, but I'm not gonna overthink it, thank you man!!
love to hear it
I first watched your video, got most of it but still couldn't wrap my head around it so watched a few other videos and came back to it and watched again to get a full understanding. Thank you.
Wow, finally someone who actually understands how to meaningfully communicate ideas to other people (what's that word called... "teaching"? But I thought that's what my university was supposed to do? hmmm........)
Thank you for these videos, I'm currently studying for algorithms & data structures exam and you are very clear in explaining how these algorithms work!
this is an important algorithm where many other people explain it may go into detail and thus confused me. I looked for, like, 6~7 video explaining this algorithm, you are the best.
+Huang Eric Thanks for watching.
Nice video. Thank you! Had been taught with using the residual graph and moving arrows. The idea of just using forward edges that are full or backward edges that are empty is so much easier to understand.
I'm so lucky to find this video, thanks a lot! Positive comment: clear voice and clear visualization, make your explanation easy to follow. Negative comment: nothing.
Thank you from a NIgerian 🇳🇬 in Canada 🇨🇦
God bless. A lot of my buddies are Nigerian. 🇳🇬❤️
@@MichaelSambol Then you're in good hands, mostly 😆🤣
this is beyond amazing
it took my professor an hour to discuss this
thank you
+Erio Touwa Glad you enjoyed. Please share with your classmates, thanks!
+Erio Touwa I bet you didn't understand as well as you did after watching the video :D
+Pink Freud Estudante do CSGO, e quem diria, estudante de Grafos também hahaha Muito bom o seu canal Pink!
i love you man this is the first of your videos i watched but it wont be the last. i learned more in 5 min here than i did in 100 mins in the lecture last week.
Whenever I see any video uploads from ur channel,I become a bit relaxed for the topic u covered in that video....hats off to you man!....
Big thump up for you! I tried for hours on end but your five-minute video "destroyed" everything!
Thanks man, you are awesome.
The single reason why I am graduating college!
😬
This is how teaching is done right. Not often you come across it. :)
Your videos are really good for introducing the concepts used in algorithms! Watching this together with videos from e.g. Abdul Bari is what is getting me through this AlgDat-course.
This 5 min video made more sense than 14 weeks of university lectures.
You had Ford Fulkerson for 14 weeks? We discussed this in like what... 30 minutes? + residual networks and the actual algorithm are missing here. Good video for what it's set out to do, no doubt, but 14 weeks..? lol
Finding the Min-Cut confirms your result, which passes thru Edges: SA, AC, CD. Using an S-T cut, where S is in area A and T is in area B and directed edge starts in A and ends in B. Thanks
we just had exactly that in the lecture just now from 8am- 1pm.... and in no way was my question i had answered ..... (why not choose A-C ) you clarified that for me .... thanks i hope it helps me to manage tomorrows test :)
i ve been following your videos since ever ,it makes sense than all wut my teachers say in a one hour and half lecture
It took my professor an hour to stumble through this. Thanks to you, I now understand this actually fairly simple algorithm.
This is exactly the channel I had been searching past 2 yrs. Great explanation!
you just explained simply in 5 mins what my lecturer couldn't in 50 mins
I got the total capacity with 20 , with the following paths :
S -> A -> D -> T = 8
S -> C -> D -> T = 2
S -> C -> D -> B -> T = 6
S -> A -> B -> T = 2
S -> C -> D -> A -> B -> T = 2
Total = 20 , with 7 saturated edges .
same
wow that was the clearest ff algorithm explain i've ever seen
Revisiting after 1 year, still the best!
Found it really helpful to watch your video-algorithm examples for my operations research exam . Thanks for uploading it
thanks man! You saved me by a few hours of struggling :)
Thank you so much, you are awesome, I understand everything my prof couldn't explain in half a semester.
Your videos got me through my alg class!
💪🏼❤️
Finally, a competent explanation on this
Your teaching style is awesome! Thanks!
I have exam in 2 hours on this. Lifesaver
🛟
for people looking at it and having a bipartite graph where an edge is either 0/1, you don't need to calculate bottlenecks, you just repeatedly trace a possible path.
this 5 min can help me in my tomorrow exam viva,
Thanks
This man is .. our savior :)). Thank you !
This video is amazing!
Recommendation: Edmonds-Karp Algorithm
I wish I found this video an hour ago! Good stuff thanks for the help!
I was going to check the sources for this video to mention them in my homework, only to find out you studied at TUe as well xdxd, I dont know why but I found that extremely funny. How small the world is
This man is a savior
Omg this is so good, it makes so much more sense now.
Thank you a lot tomorrow i have exam and just now I understand it ♥️🙏🏻
This was really useful, thank you. An example of the minimum cut edge would be ideal too though
Hlo
Hlo
Hlo
Hlo
Hlo
dude, your videos are gold!
legit life saver. if the sumery of the course would be as good as this video was legit would have get the easiest 100 of my life. ty so much
Omg this saved my life! Just kidding, I may still fail tomorrow 😅
so did you fail
DEAD!
We need UPDATE!
It was my first semester in master program. The course was CS6363 Design and Analysis of Algorithms. I probably failed and wouldn’t want to check my final grade. Really bad. I def will work hard next semester.
Man your videos literally save my life, thank you so much!
this 5 minute video made more sense than my entire college degree
Thank you! Clear cut explanation in just 5 mins!
This helps when you elaborate on a reading
You did more than the textbook, which didn't mention enough to even as much as know what was going on at all. Thx!
Bro, in 5 minutes I understand it, now let's pray that I pass my final.
And?
yes yes sure for all of you this made more sense than lectures. Have you tried trying to understand it on a deeper level following those lectures?
thx from korea
Perfect video, cleared my doubts, plz give a algorithm for this too
you are life saver man, thanks for your great work.
Congratulations for the clear example !
Discrete math, Algorithms, Combinatorics, Graph theory. Taking those in a sequence has caused me to come back to watch this video at least 100 times.
Thanks mate, short but precise explanation
Gracias, saludos desde Chile
Estoy aprendiendo español 🫡
@@MichaelSambol siga aprendiendo maje
Thanks a lot my man i've been looking for videos in french about this algorithm then i find your tuto... God bless you guy!!!Keep it up!!!
Very clear and comprehensive explanation.!
nice video. I had no concept about the algo but now i understand the thing.
You just saved my life
u saved me in uni dude ty so much
Very good for someone just before exam.
Extremely clear overview of the algorithm. Have you considered making a separate video for the corresponding proof of correctness?
this video will be likely to save my exams, thanks from France
I used to live in Metz. Good luck!
The 227 dislikes are from profs that fail to explain how this works
What an awesome and wonderful video. very lucrative. please do more on sensitivity analysis /simplex algorithm.
3 lectures, 4 and a half hours of material, covered in 5 minutes, and in a better way. Sometimes I wonder how did my professors get the job...
its very useful for me thanks for your clear explanation
thank you so much!!!! greetings from argentina!
It was a very nice and short explanation! Nice job!
A very intuitive explanation, thank you
I don't know why i understand people on youtube more than proffessors in the university
man , you saved my life
Thank you for your work. I understood everything
excellent! thanks for watching.
A little contradiction in my algorithms class - professor mentioned running time is O(m * n * C) and BREADTH first search is used to find augmenting paths...found this difference interesting...I guess its not the focus of this video though. He was saying we should be using breadth first search because we are interested in the shortest possible paths.
This video was perfect. Thank you.
Nice video, this is definitely gonna help me with my programming task
step by step proceeds to modify half the edges at the same time.
Explanation is good and simple, can you please explain the time complexity as well?
Thanks for the video! It made so much more sense than my university lecture haha!
really learnt a lot! thank you so much!
chokran sahbi (y) (y) You're a life savior
Amazing clarity.
Question : Is there any criteria for finding augmentation path or is it random?
it is random. The only difference between going in a certain sequence rather than another sequence is it may take more iterations for some (the while loop doesn't care). But this algorithm always gets the MAX FLOW, which is what we need. The reason it never 'gets stuck' is with the use of backwards edges which allows you to essentially 'backtrack' when the edges get clogged up.
@@GucciJohanne It actually only works if all capacities are rational. If there are any irrational capacities, it might never terminate.
Michael is a beast
man u're a life saver thanks a lot
thank you so much. This explenation is pretty awesome and I finally understood that algorithm:)
It was six weeks for me of university lectures. Please somethings on Warshall Floyd and Simple way to depict Euler proofs. Thank you for this video. Thank you very much