DM 01 Max Flow and Min Cut Theorem Transport Network Flow Example Solution

[@alienekoo]

youtube just saved me again.

[@learncseasily3385]

Nycv

[@shishirkushwaha9120]

Very organized, very clear audio and explanation, to the point. Thank you.

[@sudeepswain9802]

Quite systematic. Great work!!

[@shadinsakib6040]

Thank you from core of my heart. I really mean it. You saved me from taking retake on my Data and Analysis Algorithm

[@vitorpepe9515]

3 hours looking for someone to explain me this on youtube and you did this perfectly in 11', thanks bro

[@simondellinger1376]

man, I wish my professor just taught it like this! You saved my grade

[@frankshen5110]

Thank you so much. Very clear and straightforward examples.

[@user-oo4cm7nj9v]

Thank you for this video. I have spent several hours trying to understand from class and other sources. You made it simple for me 👍

[@Yaqoob-Nu24]

Yeah,, Same here my frnd 😍

[@minhngoc390]

thank you so much for explaining step by step so clearly!!

[@englishwithhajarech1970]

From Morocco,thank you so much for this great explaining I wish.you a good luck You deserve all the best

[@ramankumar41]

Best explanation on the internet for this topic !!!!!!!!!!!!!!!!!

[@sadiyaahmad6680]

This was a good video on this topic. Kudos to Guru Vidya. Please make more videos like this.

[@Mitfly]

Thank you so much for this video! Great work!!

[@saadarshad4635]

bht dhannebaad bhaiiya, love from Pakistan

[@aiwaittimetracker9354]

The best Explanation ever with best Writing :-) Just One Word => "AWESOME". After watching Your explanation I realized that It will not need to create multiple figures as well as no need to create the Residual Graph to find the solutions. Thank you. You saved a lot time for the exam.

[@guruvidya7339]

Glad it helped!

[@sahilshahane1547]

explained wonderfully! thank you

[@smartmath9039]

Thank u very much for ur nice explaination.. it helped me so much n its very clear.. welldone..👍👍

[@AbalPoudel]

Best explanation till date. Thank you sir ji.💙

[@jayeshmagare350]

bhai tune mera kaam bahuat aasan kar diya thank you bhai

[@meetpurnale]

Very nice and confident explanation

[@muwaffaqimam3790]

Just PERFECT!

[@salmanshahid8128]

Thank You so much Sir. We appreciate your efforts. ❤️

[@tamannatamanna3601]

Thank u so much sir for such a good explanation and also your handwriting is very superb

[@Collins01]

Hey man, this was helpful. I am really grateful.

[@amitarora6422]

you are the only one , who cleared it to me , thanks sir

[@guruvidya7339]

thanks

[@prafullsharma4296]

great explanation, thank you very much!

[@ShubhamKumar-gz5rr]

Thanks for the video.. it was really helpfull

[@ongidivincent-mamamulayi4410]

thank you you are a good teacher.

[@achraf7757]

ty very much .. that's so kind of u good sir .

[@marriagealbum]

best explanation on youtube

[@samafianasar3749]

So interesting method Thanks a lot sir

[@veerannakotagi1059]

Super explanation sir.Thanks a lot

[@mohammedaamerkhan8645]

Thank you Sir g. Very well explained in an easy Manner 😍....

[@soklylorn7665]

Thank you so much Sir for this nice explanation.

[@reginaphalange1361]

Thanks you saved my grades

[@user-xe5pk5pn2u]

Bro continues to save. Thank you.

[@nikitaprajapati233]

Good explanation ...!!

[@068_gauravchakraborty]

awesome explanation thx a lot :)

[@omkarkulkarni2595]

very helpful. thanks!!

[@westwest2008]

Perfect, Thank you.

[@rajkumarchavan8457]

Thank you so much sir!

[@adilmughal2251]

very clear explanation.

[@mironabdullah4820]

good job man.

[@tamuzgitler4390]

amazing!

[@lawrencemwansa290]

This is awesome

[@ms.kartik_dev]

🎉🎉nice explanation

[@akistegos7397]

Great video

[@pallavinagamalli2495]

Simply super sir

[@janemarybabirye1969]

Thank you very much 🙏🙏🙏

[@Gaurav.Kumawat]

nice explanation.

[@muugiiwara]

Thank you sir you saved me

[@ammvolmet]

Explained well

[@an1sssssss]

ty so much brooo ♥

[@sumithramariselvam1280]

Nice explanation

[@tacklewithtricksbykajala.4231]

Sir plz add more videos on advance algorithm

[@krishmehta7903]

i am confused max flow min cut and ford Fulkerson algorithm is same ??

[@takudzwamukura7172]

You are a life saver

[@BlinkCodee]

Rocked on easy peasy

[@taha7shaikh]

Thank you so much

[@wenwenli2265]

sooooo helpful

[@aiswaryap2471]

Thankyou sir🙏🏻

[@shubhamyadavupsc9223]

Sir is this similar to flow augmentation algorithm?

[@premrauth8416]

Thank you sir

[@md.alamintalukder3261]

Thanks a lot

[@babi2488]

Thank youuuu

[@tanmayrathod3609]

thank you brother

[@sorasora3611]

الله يوفقك

[@shivachauhan8179]

perfect!!!!!!

[@manelkid488]

Thaank you 🙏

[@notouthasib1123]

thanks

[@shubhamdarekar.]

Thank you sir..

[@RaghadZeidan]

thank you! but for this method to work I have to start the path from the edge with the maximal capacity? for example in your graph I must start the path with the edge (a,b) that has a capacity 9, and not from (a,c) that has a capacity of 8. I'm saying so because I've tried it in another graph, it worked only when I first start with the maximum capacity path.

[@guruvidya7339]

You can start with any path....answer would be different but valid and correct.

[@Abhijeet.012]

Thanks ❤

[@ivanalam7326]

Is this the Ford Fulkerson algorithm

[@AadeshingaleOfficial-zl5fd]

Nice Sir 😊

[@user-yl1ix9er9y]

thank you

[@parikramacollege31]

Last moment ❤️

[@davidsflightsim8168]

I don’t want to attend my lecture after this video

[@Faieq_Tazwar_01]

Thnk u sir...

[@ajaybedre4199]

good handwriting

[@story_time_bd2512]

Is it ford fulkersons algorithm?

[@osmankhalid2005]

No, it looks to be some custom method. As per Ford Fulkerson method, total incoming flow to a vertex should be equal to total outgoing flow from the same matrix, however, there is nothing in the video.

[@slayvenom5900]

hats off

[@Iamkishorekumaran]

Why you left the b-e remove block 10:29 explain

[@HUNTER-yc4fe]

Sir, we can't say by left or right that it's source or sink. All the inward edges to a node is called sink and all outward edges from a node is called source.

[@pjbhaumik]

Why not start with a ->c instead of a->b? then everything between a and c will reach the sink.

[@_ANKUSH-dc5rw]

thank u sir

[@manidharparuchuri3242]

Sir how you cut that edges sir?

[@_lokeshsonawane1038]

thanks sir

[@only_for_fun1234r]

Why maximum flow is 4 unit? It will be minimum n in b to d

[@sanaqabil3128]

a-c-z max flow is 2 not 3 becoz 8-6 is 2 so the residual capacity is 2.

[@guruvidya7339]

Its not 8-6. a-c is 6 and c-z is 3. so 6-3=3 is max flow for a-c-z.

[@asian1599]

for max flow, doesn't the order in which you choose the paths affect the outcome?

[@guruvidya7339]

You can choose any order.....answer would be correct

[@eng.mariamalhussainy687]

Excuse me sir why u subtract and divide in to once on 1 once on 5 once on 0 i cant understand it please?

[@guruvidya7339]

Its not divide.....just remaining capacity is written left side....Like if you consider path a-b-d-z.... the maximum capacity is 4 ...thus substract 4 from every edge's capacity.Hope u got it.

[@hahonganh9]

is the capacity of cut always = max flow?

[@MrBuckethead911]

yes

[@namreggerman6836]

no, its not! You try to find a cut that is min and hence this cut is equal to maxflow. There are possibly other cuts which are larger than maxflow. This means that any cut in a Graph is an upper bound to the flow from s to t but the min cut is the thightest upper bound which is equal to maxflow

[@guruvidya7339]

@@namreggerman6836 yes

[@osmankhalid2005]

@@namreggerman6836 Can we say it like: value of "min cut" is always equal to "max flow"?

[@muhammadayazfaridshah3694]

B to E blocked h solution m q mention h ye edge to remove ho jani chye the ????????????

[@ttobg]

could min cut edge be : bd, be, cz and ce?

[@prajwolraj2353]

do you know the answer now?

[@supriya9137]

b---> e edge is also removed but you have not counted it in min cut why?

[@SHIVAM0999]

It is just blocked Not totally removed see it carefully 🙄

[@adarshshukla2055]

If we cut edge b->e instead of c-z we can't divide the source and sink into two other set x and y

[@VirtuousVisions]

sir can we use one time figure instead drawing it again and again

[@anandd7556]

Drawing it again and again will tell you which link is available and which is blocked....this is useful to find max flow

[@torikulislam9863]

in cut theorem b->e ??

[@guruvidya7339]

dont uderstand what you are saying

[@nmwareesh]

I'll write your name on my graduation cake ...thanks alot

[@vanshsharma1498]

Sir b to e , already blocked But you are not added

[@vanshsharma1498]

If we add b to e than max flow is not equal to min cut

[@vanshsharma1498]

Why you don't add b to e