Ford Fulkerson algorithm for Max Flow

This video explains the basic Ford Fulkerson algorithm for Max Flow. Short and sweet with one example worked through.
Pause and rewind if it goes a bit fast during the example, or anywhere else of course.

Video lesson made for a coursework in DSA at the University of Bristol.

[anqianzeng]

Jesus Christ! My prof spent 2 hours on this, and no body understood shits. and Your 6 mins video did the work!

[incognito]

Whoever you are, thank you for this. Your voice is very calming and your explanation is very easy to understand. I have a final on the entire CLRS book and this helped a lot. Thank you again.

[vabdklafmsld]

Short, simple, well-spoken. WE NEED MORE OF YOU!

[joshuamullen]

You did a pretty good job explaining this, but your double audio at 2:27-2:37 threw me off for a second there lol.

[yelnil]

That was probably the best, simplest explanation for that algorithm.

Thanks a bunch!

[sweetgirlp]

I didn't understand the explanation in my textbook but this video was great - very clear and simple . Thank you!

[zackmicheal]

Very good example, which helps me to understand Fulkerson algorithms immedately !!! So much thank to you !!!

[nikhilchauhan]

thanks a lot, stuck on it for a couple of hours, saw a number of videos but yours was the most helpful one

[dhanajitbrahma]

Awesome short, sweet and clear explanation...

[zakenmaru]

This explanation was extraordinarily helpful. Thank you so much!

[KnotgoodAtIt]

nice explanation, but I wish there were reverse edges in this example

[vahhowh]

You explaind the algorithm very well thank you very much

[aldeco]

life saver, thank you. my test is in a few hours, this really helped.

[Siyanx]

omg this the most easy to understand video for this algorithm i have seen, Thank You :D

[frankliu]

I'm still slightly confused on backwards flow. First off, why do we do it? Is it because we have leftover capacity for flow on the forward edges? And if so, does the backward and forward flow have to add together and be less than or equal to the capacity of the edge?

[AstroWithRaj]

Thanks That was a great help in understanding max flow in network.

[GibbaBites]

great explanation, everything is clear now

[truepersian]

+LILD in the end, shouldnt:
S -> B = 6
and
D -> T = 4
?

[danielkalcsuk]

You have very sweet voice. Thank you for the video, it helped a lot :)

[blackhatful]

in the residual graph you have to add some constraints so :: Cf(u, v)=Cf(u, v)-f(u, v) is true only if f(u, v)<=Cf(u, v)
and Cf(v, u) equal f(u, v) and not Cf(u, v)+f(u, v) and this is true only if f(u, v)>0 .
Also after finding the the augmenting path and Cf(p) you have to add some constraints : Cf(u, v)=Cf(u, v)+Cf(p) is true only if the edge in the residual graph is a forward edge.And Cf(u, v)=Cf(u, v)-Cf(p) is true only if the edge in the residual graph is a backward edge.
And the algorithm stop when there is 0 augmenting path in the residual graph then we can say that we have the maximum flow |f|.