Edmonds Karp Algorithm | Network Flow | Graph Theory

[@hdm_vision]

better than 3 hours lecture in class

[@utkarshgupta2909]

Yes to the point

[@hafezghaemi6237]

This channel does not sacrifice theoretical details for high-level explanations. Perfect!

[@CptCatpain]

Yeah 6 years after this got uploaded i had to watch it. I have a presentation tomorrow about the ford fulkerson method and want to introduce edmonds karp as well. And your explanation was so good! Thank you!

[@amido68]

7:25 there are two available edges to follow as in the slide not one. Thank you for this Explanation

[@RubLox_Live]

He was talking about the 2nd node which only has one feasible edge

[@barlikwornik3769]

Great video! I wish college lectures were thought like this.

[@egedenizi97]

You are a life saver. Thanks man!

[@chanwoolee303]

I'm wondering how you can teach so well. I wish there was a supersubscribed button that your posts stand out first.

[@bhaskarpandey8586]

There is and it is known patreon.

[@TimonSchneider-e7b]

Thanks for making this!!!

[@stan-xd2pr]

great explanation sir, thank you

[@yka9632]

i speak french. Yet it was more understandable than what my teacher said

[@nikitagupta8114]

Thanks, the video is precise and easy to follow.

[@18meiy13]

So well explained! Thanks so much!

[@abhishekgupta7719]

Thanks for teaching

[@allenhung4390]

Thanks, it's so clear and informative.

[@nii-san5485]

thanks, wish you explained how the residual edges are used though

[@danielayala6652]

In summary: - Ford-Fulkerson: Tackles the Maximum Flow problem using DFS (O(Ef) Complexity) - Edmonds-Karp: Tackles the Maximum Flow problem using BFS (O(VE^2) Complexity)

[@nevochen]

you are THE BEST!! thank you so much!

[@OriginalEch3Official]

At 8:27 the max flow cannot be found by summing the *capacity* values going into the sink. What you are circling around are not capacities but flows. The sum of the capacities going in to the sink would be 5+15+10, which does not say much. According to the min-cut-max-flow theorem there exists a cut of the graph that will give us the same capacity sum as the flow sum of a cut, but in this case that cut does not do it. Notice also that any cut will have a capacity sum greater or equal to the flow, which leads us to conclude that the cut that gives the minimum capacity sum is equal to the maximum flow. This can be seen on the cut ({s}, V\{s}) for instance.

[@liaoweien]

Thank you for doing this great video. Can you please explain why Edmonds Karp is independent of the flow value? From What i see from the video, it can still get into the increment by 1 flow value in the shortest path. Thanks in advance.

[@WilliamFiset-videos]

The time complexity to run Ford Fulkerson is O(E * f) where, f is the max flow. The time complexity to run Edmonds-Karp is O(V*E^2) which only depends on the number of vertices and edges. Since the time complexity of Edmonds-Karp doesn't depend on f, the time to run the algorithm won't depend on the value of the max flow, that's all I meant.

[@josiahsweney4023]

Thank you so much for this very informative video :)

[@milindprajapat7177]

Why do we keep track of negative flows?

[@tudorradu5848]

Great tutorial!!!!

[@manno0d]

great work, Thank you

[@SaisankarGochhayat]

Great explanation thanks :)

[@tuhinmukherjee8141]

Could you please explain the time complexity of this algorithm?

[@xXFireCrasherXx]

Awesome video! One question though: Is the intuition behind taking the shortest path edgewise that the chance is lower to find a small bottleneck edge?

[@wes_m_]

Bless you sir

[@iskhwa]

Thanks. That was perfect.

[@lucianoinso]

At 4:00 why would you pick the lower vertex when using DFS? I know you say it's supposed to be a random DFS, but the original DFS algorithm just keeps going forward. Also thank you so much, there are not many videos on these subjects, I'm now preparing the final exam and your videos are way clearer than those available when i was studying for the midterms last year.

[@WilliamFiset-videos]

Just to prove a point that a DFS might pick a non-optimal path from s->t

[@just__khang]

this is very nice.

[@yahyairfan1159]

Thanks Please upload another example for this in which any of the edje connected to the source has large capacity than othor edges in its augumented path

[@khushbookkumarii]

quality content .

[@benmarcus2577]

first of all thank you so much one thing i was a bit confused about was how do you know which is the shortest path when you finished a round of bfs (as in the bfs doesn't return a shortest path...)

[@WilliamFiset-videos]

It doesn't matter, any shortest path will do

[@benmarcus2577]

oh, right good point, thank you

[@vasyasmanager2you]

Hello. Can you please make a video explaining the principle and demonstrating the programming application of Blossom algorithm?

[@thepinkcodon]

awesome! thanks a lot

[@ShakrinJahanMozumder]

Thanks!

[@j_blue6784]

5:25 appreciate the symmetry xD

[@narendraparmar1631]

thanks sir 😊

[@chaitanyasharma6270]

why no pseudo code

[@alexanderyaroshenko4461]

Thanks bro.

[@aishwaryashrestha798]

what tools do u use to make network vedio ? please tell me

[@rupinmehra99]

legend

[@劉宇哲-y2i]

Isn't this algo use breadth first search?

[@elestirel3131]

adam ya adam

[@jenweatherwax7113]

I am so confused 😵‍💫

[@ssshukla26]

A request can you please teach university professors how to teach? No, don't, you better get some bucks through no of views on KZbin. Professor are taking hefty salaries for nothing.

[@shang_chi4651]

Well said👍

[@v_iancu]

I gave a dislike to this one because you didn't show how backward edges work, I'm sorry

[@Sukhraj_Sekhon]

Watch the previous video, he said explicitly that it was an extension of the Ford Fulkerson algorithm. In that video he does explain it

[@kells9k]

Dude seriously thank you so much this video was SOOO much better than that crap shoot by Ben Owain or whatever that british dudes name is