Lec-40 Ford Fulkerson Algorithm For Max Flow | Hindi | Operation Research
Вставка
- Опубліковано 6 вер 2024
- #fordfulkersonalgorithmformaxflow
#maxflowproblem
#fordfulkersonalgorithm
Connect with me
Instagram : / i._am._arfin
LinkedIn : / arfin-parween
Twitter : / startpracticing
Email : wbstartpracticing@gmail.com
Hii ....Our topic is ford fulkerson algorithm for calculating max flow in hindi.. In this video we calculate maximum flow in given network using ford fulkerson algorithm...
The Ford-Fulkerson algorithm is used to detect maximum flow from start vertex to sink vertex in a given graph. In this graph, every edge has the capacity. ... Flow on an edge doesn't exceed the given capacity of that graph. Incoming flow and outgoing flow will also equal for every edge, except the source and the sink.
THANK YOU FOR WATCHING
___________________________________________
Please like share comments and subscribe
___________________________________________
To watch more tutorial, press the below link
How to draw network diagram all basic concepts
• Lec-35 How To Draw Net...
Calculation of earliest time latest time float and critical activity
• Lec-36 Calculation of ...
Critical Path Method ( CPM )
• Lec-37 Critical Path M...
Program evaluation and review techniques (pert)
• Lec-38 Program Evaluat...
Difference between pert and cpm
• Lec-39 Difference Betw...
Travelling salesman problem
• Lec-33 Travelling Sale...
Maximization in assignment problem
• Lec-32 Maximization As...
for watch more tutorials pls visit the playlist in the channel
channel: / @startpracticing
playlist of operation research
• Operation Research In ...
Playlist of Transportation Problem
• Transportation problem...
playlist of probability for engineering mathematics
• Probability (engineeri...
Playlist of Data Structure and Algorithm
• Data Structure and Alg...
My UA-cam Shorts of Operation Research
• Operation Research Shorts
Ford fulkerson algorithm for max flow, ford fulkerson algorithm in hindi, Ford fulkerson algorithm in operation Research, max flow problem in operation Research, max flow problem in hindi, max flow problem for fulkerson algorithm,
I'm not praising lies. you really explain well and in a simple way. I appreciated your work. ❤️ from Kolkata
kothay thako??
I watched many videos but no one said as clear as you. U Explained in simple and clear way. Thanks a lot❣❣❣
Thank u..You have no idea how many students u help through this video every year!!
wdym, she can always see the view count on her video to get the idea lol
Every time you taught very clearly..You always tried to dump the waste inside mind created during study. Thank you ma'am
Got confused after watching 1-2 other videos , concept cleared after watching your video . Thanks for posting such quality content. 👍
It's 4:43 am right now and you saved my life (and my exam ) ::))
Thankyou so much
3:45 AM here and I'm in the exact same situation XD
@@shashwatsingh4 okay
oh that is great
4 22 am here
4:12 AM and same situation lol
Maam I love u ❤ I got 7 marks from this.
The only long question that I got correct 🤣.
literally watched this 2 hrs before my exam.. understood in first watch at 2x speed thanks!!!
ma'am teaching ap ka hidden talent ha. is talent ko hidden hi rehne dain.
🤣🤣
Your videos are fantastic! I've been watching them from Afghanistan, and I really appreciate how you make everything so easy to understand. Thank you so much! ❤❤
Thank you
THANK YOU!! -From Arizona,US
Thanks for this tutorial, if i pass my exam with good marks i will surely support you by liking this video
ZabarDast ! This is the real method of teaching . Thanks :)
What an explaination! Hatsoff to you for making it simple like this.
the second column should be residual capacity instead of bottleneck capacity, shouldn't it ? because you are taking residual capacity values in that column
@@sairatnakamble3575 I thought the same thing. should be residual capacity
Clear explanation, recommending to everyone.
आपको नमन है मैम हमारा आप बहुत अच्छा समझती हो ,very very very thanks for you please keep it
i was searching for good explanation for programming. Hindi is not even my first language. but i got a very good explanation from here. Thank you!
Thankyou For The Clear Explanation❤️
Fact that I understood this even when I don't even know the language is incredible
this is by far the best explanation compared to all other videos on youtube
end mein node 5 to node 7(sink node) mein abhi bhi residual capacity is >0 so why did we not use it? , BTW i loved your teaching
though I don't understand Hindi, I get what you said soo well. Thanks a lot!
Even after 3years it's still helpful👍
maam pura smj mein aaya college ke teacher ke pass class laga ke bhi nahi smjta isliye youtube pe aake learn kiya hu thank you
and also my friend is saying from his side thank you we where doing group study .
thank u so much mam..really explained very well...so nice of u..ur presentation was awesome...
mam aap na mere college ka proffesser ban jaiye sach me mam pure 6month se kuch samjh me nhi aa rha tha aap bilkul simple way me smjha diya atleast feel to ho rha hai ki Exame me kar lunga mai thanku so much mam
Iam from Andhra Pradesh your explanation is amazing you are explaining very well in a clean manner
Thanks for making such a helpful stuff. I really appreciate it.
Clear and simplest explanation ever.... I can secure 7 marks for this topic.
Thank you very much for this easy and clear explanation.😊❤️
Great Explanation!!!!!! Really made the concept clear.
thanks ..your explanation was so good yarrr..thank u so much
Thank you ma'am. Keep doing the great work.
thank you soooo much maam this video made me understand the whole concept at 1 stroke thanks
❤❤
This explanation saved my ass in exam omg 😭😭😭😭. thanks didi😭😭😭
Yes mam, great explanation processes. I really impressed❤ . Please if you give a step by step algorithm according to this problem then also much better ❤❤❤❤❤
I saw many videos but I was confused but from your videos is realy easy to understand thanks
Just in Love with your explanation..!
Very clear explanation... Thank you ma'am ❤️❤️
Thank uuu mam hmari HOD sy to acha hi smjhaya h apny thnku thnku
This is helping me a lot during exams
Really helpul for before one day exam like my type of student mam thnx
It was really helpful thankyou.
Very very good explanation, I appreciate it all the way from Canada thank you!
Thank you so much ma'am...i was really afraid of this subject in mba as my background is commerce but now my concepts are clear just because of you 🙏❤️
Hi
Hi sweety
Crystal clear explanations. Thankyou madam. Keep posting more.
Very good ma'am from Bengaluru.. 😍
Thank you soo much for the explanation just amazing!!!!
One of the best explanation on this planet!!
Very very good easy 🙏🙏🙏🙏🙏❤️❤️❤️❤️❤️❤️ thanku mam ji ❤️❤️❤️❤️
Exam savior explanation ma'am.
Thanks a alot❤
You explain really good,mam
Wow...this is the best video on this topic. Thanks a lot!
Excellent Work....Easily Understandable 💯
Advanced data structures mein graph theory me bhi e concept hai... thanks 🔥👍
Great work ma'am apny Boht Acha smjha ya
Thank you so much ma'am...Sooo clear explanation ❤
Ur videos are very helpful and u r making everything easy , my humble request to make video on “minimum cost flow “
1 day before exam .thanks a lot now I can feel confident that I can solve problem on max flow.
Thank you so much... straight and simple explanation made this topic really easy ... God bless you ❤
Great explanation!
Trika smjan da boht ghaint 👌👌👌👌👌👌👌
Thanks a lot ...SEM 5 student hu, kaafi help ho gyi
Thank you, teacher 🙏🏻
Really well explained.
Concept clear 💯 🙏🙌
Very nice explanation mam.
you are great mam, love from bangladesh.........
very nice explanation👏
Woh very good explanation 👍👍👍🥰👍
Your voice is as cute as your explanation
wow very nice good job
Thuku very much maammmm
Apka video mera assa lagtahu, from Bangladesh.
mam thank you so much what a teaching ❤❤
Thank you so much !!!
Nice Explanation
and Great ❤️
nice explaination!
thankyou for explaining so clearly.
quite understandable stuff!
Hands down best explanation
Simply impressed👍🙏👍
Thank you ma'am.
So nicely u explained
thanks a lot mam for this wonderful knowledge
Thank you so much very helpful video
Very good explanation.Thanks u for this vdo.
thank u
Well explained.... Very helpful
Crisp Explanation ! Thank you.
Thank you ma'am ❤️ nicely explained
Backward edges in a path are not taken into account. This may give sub-optimal solutions.
Yes, this is not optimal solution!
I have just started this topic, backward edges are used to find residual capacity which she is doing in the question so concept is not wrong I think
@@tanvivarshney6033 She is not finding the residual capacity properly. She is not providing any option to reduce flow along any edge, it can only increase with every iteration. In the example which she has shown, the final max flow of 12 is correct. However, there are lot of networks where this approach will give incorrect answer.
Example: Network ( [s ->a = 10], [s ->b = 7], [a -> b = 10], [a ->t ] = 7, [b->t] = 10). For this network, the max flow you will get from above video's logic is 10. However, max flow possible is 17.
I followed her method and its giving correct ans i.e 17 for your example network!
I would suggest to follow this video if any one is having trouble with Ford Fulkerson algorithm.
Awesome and it is very lovely video...
Mashallah great
thank you so much maam
Excellent Explanation...........
good job maam
well teaching
Amazing work! 👌