Ford Fulkerson algorithm for Maximum Flow Problem Example

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

[LB-ljwp]

I am so glad India exists, 90% of my knowledge came from you guys. Much thankful <3

[dhavalchheda]

I think many people are getting confused here regarding the back edge and it being non zero. For those who are having confusion, idea is to keep the inflow and outflow through a particular node same until it hits the Max capacity .And if it were to be zero you can't use it as a back edge hence back edge needs minimum 1. As long as their is equilibrium through a particular node and doesn't exceed capacity, you can change the flow as you want.

[RaynerGS]

at 11:45 my persistent doubt about this algorithm was vanished, thanks so much for your class. Well done. A salute from Brazil!

[youtubecommenter]

People like you have taken me through my computer sciences degree!

[labandaetoilista]

I had many Problems with the Ford Felkurson Algorithmus, now after watching your video i've to the first time understood what the proffesor the hole Time in the classeroom wanted to clarify but he couldn't as well as you done !
Many thanks <3

[nikezofficiel]

I was overwhelmed before I watched this video.
Then I've thoroughly a great amount of information about Ford-Fulkerson method. And now I am excited to confidently use this method.
Thank you for existing, you're a lifesaver.

[osmankhalid]

If we choose following paths, the same can be done in just 3 steps:
S -> A -> B -> T = 4
S -> A -> D -> B -> T = 6
S -> C -> D -> T = 9

Which makes a total of 19 :-)

[mosaic]

why cant i choose s>c>d>b>t instead of s>c>d>a>b>t, is it necessary to go with the backward edge?

[Bianca-zodm]

Is there a particular order our argumenting paths should go?
For example, why do we not do S>A>C>D>T?

[needleskane]

I got confused about the back step but now I understood, thank u very much

[shahidsiddiqui]

First beautiful handwriting and second amazingly explained Thank you so much Sir.

[poetrycorner]

sir je at 6:31 why we are choosing from D to A there is dircted path for A to D not D to A????

[arafatahmmed]

Another ways to clear the concept ::
Path :: SCDT -> 9
SABT -> 4
SADBT -> 6
Total max flow = 19

[harshitmehra]

Thank You so much, Sir, your teaching has warmth and guidance.

[swativekhande]

Really impressive sir !!!
I have no idea before I clear all my doubts

[halah]

Mr:Arnab thank you very much you are the best one .

[hemantbohra]

I have choosen path s>a>b>t = 4
Then s>c>d>t =1
Then s>a>d>t = 1
Then s>a>d>b>t = 5

And got max flow 11

Is it correct??

[mhrhabib]

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

[memoryLB]

Thanks for this video. I understood the goal and process of this theory generally. However, i am still quite confused because the selection of the path is little chaotics.

[LvGbLiNd]

I absolutely heard "Now Niggas discuss" at the beginning and was like WOW hold your horses D: