Ford Fulkerson Algorithm for Maximum Flow Problem

Ford Fulkerson Algorithm for Maximum Flow Problem
Watch More Videos at
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited.

[Ms.rishwish]

What matters is his fluency in the subject matter. And that is at par. I speak fluent American English and yet found his video super helpful. So stop fussing about the language. His lecture is perfectly understandable and he is thorough with the explanation of the subject. Thank you Sir!

[adamszef]

Very good done short "lesson", clear and easy to learn about max flow using FF algorithm, effective-fast-practical way to see how is working this method in network

[mhrhabib]

Thanks. Very Nice, Fold up & Clear lecture. From Bangladesh .

[hannahsabir]

Very clear teaching! Thank you very much

[wanted]

thanks for your video and clear illustration....please mention or put link for the next videos

[sushmitpahari]

at 6:29 how residual capacity from "E" to "F" is 2 ? its written 10 like A to C is 2(11-9 =2) B to C is 10, B to E is 9 and E to F is 10

[rohandevaki]

at 6:45, how did you make it 2? what is the logic? you didnt explain

[rohandevaki]

at 5:57, only one mincut is possible?

[shubhamverma-sxre]

sequence and ordering is wrong of lectures, fresher student will feel trouble.

[rohandevaki]

how can you make it 11 at 6:43 ? no proper explaination

[ashishsahani]

Video Hindi me bhi banaye jyada logoko aur jyada se jyada samajh padega