The Maximum Flow Minimum cut Theorem

  Рет қаралды 54,528

Hoang Maths

Hoang Maths

Күн бұрын

drive.google.c...
Hoang Maths website
sites.google.c...

Пікірлер: 46
@spag5296
@spag5296 4 жыл бұрын
Your approach to teaching is magnificent. This method is a lot faster than the exhaustive approach presented by my lecturer.
@HoangMaths
@HoangMaths 4 жыл бұрын
Thank you so much for watching. I so glad my videos help you, and appreciate your feedback.
@juicyybox8726
@juicyybox8726 Жыл бұрын
Man i have been struggling so much with finding max flow especially with augmenting paths but this method of min s-t cut is so well explained and I basically understood it right away. Thank you so much this is fr a blessing.
@SkyLovesBlue777
@SkyLovesBlue777 3 жыл бұрын
Thank you so much for this. I was really confused at first but the way you explained it and your teaching, made it really easy to learn.
@HoangMaths
@HoangMaths 3 жыл бұрын
Hi Sky, Thank you do much for letting me know! It is a hard topic to learn. I'm glad that you understood now. Please keep up with the good work!
@Ruined_Karma
@Ruined_Karma 4 жыл бұрын
Very helpful video! Helped me understand how to connect it to Duality with max cut and min flow
@HoangMaths
@HoangMaths 4 жыл бұрын
Hi Anthony, Thank you for letting me know, and I’m so glad that the video helped you.
@biplavpoudel
@biplavpoudel 3 жыл бұрын
Thank you sir for helping me out. This topic was in my CS syllabus but the topic wasn't in my textbook. I had almost lost hope before this video. Many many thanks!
@HoangMaths
@HoangMaths 3 жыл бұрын
Hi Biplav, Thank you so much for watching and letting me know. Learning is active, and I'm glad that you are being proactive with your learning and found my video. Remember there is always hope. I'm sure you will do well. Good luck with your study!
@jawadhindi646
@jawadhindi646 4 жыл бұрын
Excellent work. Loved it
@lorenzosimoncini3719
@lorenzosimoncini3719 Жыл бұрын
you are great, tomorrow i have an exam and you saved me
@HoangMaths
@HoangMaths Жыл бұрын
Thank you for watching my videos! Good luck with your exams!
@Ashley-nu9xs
@Ashley-nu9xs 3 жыл бұрын
Some of my teachers have told me that if the arrow is not flowing in the direction from source to sink (e.g. the arrow is facing up) then the value from that line doesn't count in the cut method. Is this true?
@GBmeme
@GBmeme Жыл бұрын
I learned ❤️ Thank you sir✨
@thesqud6664
@thesqud6664 2 жыл бұрын
This really helped sir thank you.
@HoangMaths
@HoangMaths 2 жыл бұрын
Thank you so much for watching! Please keep up the good work.
@千里之行-z5r
@千里之行-z5r Ай бұрын
VERY nice explanation, thank you
@take_it_all_so_good
@take_it_all_so_good 3 жыл бұрын
Thank you so much 🙏🙏
@HoangMaths
@HoangMaths 3 жыл бұрын
Thank you for watching!
@sainialka9348
@sainialka9348 Жыл бұрын
what a simple explanation thankyou Sir
@isabellewise68
@isabellewise68 4 жыл бұрын
Flowing into B, why is it 8? Coz 5,2 and 3 equal 10? Not 8? Just wondering
@zzz2094
@zzz2094 4 жыл бұрын
im scared for the HSC too, dw 😂😂😂😂
@HoangMaths
@HoangMaths 4 жыл бұрын
Hi Isabella, thank you for watching my videos. The flow from the source to B is 5 units, from C to B is 1 unit only, and from A to B is 2 units. So 5 +1+ 2= 8.
@HoangMaths
@HoangMaths 4 жыл бұрын
You guys will be fine. Just do the best you can and I'm sure you will make your teacher proud.
@zzz2094
@zzz2094 4 жыл бұрын
@@HoangMaths thankyou so much
@nguyennguyendinh5215
@nguyennguyendinh5215 2 жыл бұрын
Thank you so much Professor! Your explanation is amazing!
@HoangMaths
@HoangMaths 2 жыл бұрын
Thank you so much for watching my videos!!! Please keep up the good work!
@vinayaksharma6977
@vinayaksharma6977 2 жыл бұрын
Hello, there can be different ways by which we can allocate capacity, so in some graphs I m getting different max flow by using different allocations. How to resolve this problem because there can be multiple ways to allocate capacity
@ninjaarashii
@ninjaarashii 3 жыл бұрын
Great work🙌🙌
@HoangMaths
@HoangMaths 3 жыл бұрын
Thank you for watching!
@YeonAooJ
@YeonAooJ 6 ай бұрын
Thank you so much for explaining damn
@xxemmi_xx6432
@xxemmi_xx6432 2 жыл бұрын
thanks, very helpful video, you're amazing!
@HoangMaths
@HoangMaths 2 жыл бұрын
Thank you so much for watching my videos! Please keep up the great work.
@manuelapacheco3259
@manuelapacheco3259 2 жыл бұрын
this video is amazing, thank you
@HoangMaths
@HoangMaths 2 жыл бұрын
Thank you so much for watching!
@ViolaTheSinger
@ViolaTheSinger Жыл бұрын
Is there a unique minimum cut or could there be multiple?
@vishalsrivastav2205
@vishalsrivastav2205 4 жыл бұрын
Hello sir,in the first problem why the cut was not made including 8
@HoangMaths
@HoangMaths 4 жыл бұрын
Hi Vishal, Thank you for watching my video. You do no including the 8 because the cut is already separated the source to the sink. Please try this video on the link below. kzbin.info/www/bejne/e4XEgqSbat2Sq8k
@mathematicslover7385
@mathematicslover7385 2 жыл бұрын
Thanku so much.. Sir.. Your teaching way is awesome👏👍😊 🥰.. Love from india🇮🇳
@mathematicslover7385
@mathematicslover7385 2 жыл бұрын
Respect sir.. Can you provide me?.. The proof of maximal flow or min cut theorem 🙏🙏
@md.shahidulislam7432
@md.shahidulislam7432 Жыл бұрын
I can't catch the cutting method.why we ignore 8/8 though it’s a way to. go to sink..plzzz explain me
@HoangMaths
@HoangMaths Жыл бұрын
First of all, thank you for watching my videos. The reason we ignore 8/8 is that, when you cut 9/9, there is no longer a flow from C to the sink. You might find it beneficial to check out the videos below for a better understanding of cutting capacity. kzbin.info/www/bejne/e4XEgqSbat2Sq8k&lc=UgywAkcgt2kQDNrw90l4AaABAg kzbin.info/www/bejne/g3myZYqqlLCsedk
@mitanshnarula5534
@mitanshnarula5534 3 ай бұрын
(1-cos2Q)sin2Q
@pedramvahedi4946
@pedramvahedi4946 3 жыл бұрын
hi sir :)
@arumjeon9644
@arumjeon9644 2 жыл бұрын
Hey sir, ive been trying to reach out to you on classroom as i have some questions regarding a maths paper, could you please message me there I really need help. Thanks so much !
The Maximum   Flow Minimum cut Theorem: Part 2
10:48
Hoang Maths
Рет қаралды 14 М.
Maximum flow Minimum Cut Algorithm
14:02
Joel Speranza Math
Рет қаралды 46 М.
Quando eu quero Sushi (sem desperdiçar) 🍣
00:26
Los Wagners
Рет қаралды 15 МЛН
How to treat Acne💉
00:31
ISSEI / いっせい
Рет қаралды 108 МЛН
Леон киллер и Оля Полякова 😹
00:42
Канал Смеха
Рет қаралды 4,7 МЛН
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
21:56
Minimum cuts and maximum flow rate
10:00
Juddy Productions
Рет қаралды 76 М.
Proof of Max-Flow Min-Cut Theorem and Ford Fulkerson Correctness
8:11
How a Blind Mathematician Became the World's Greatest
16:31
Newsthink
Рет қаралды 138 М.
13. Incremental Improvement: Max Flow, Min Cut
1:22:58
MIT OpenCourseWare
Рет қаралды 157 М.
What is 0 to the power of 0?
14:22
Eddie Woo
Рет қаралды 10 МЛН
Finding maximum flow through a network
4:59
Bryn Humberstone
Рет қаралды 38 М.
Max Flow Ford Fulkerson | Network Flow | Graph Theory
13:25
WilliamFiset
Рет қаралды 511 М.
Quando eu quero Sushi (sem desperdiçar) 🍣
00:26
Los Wagners
Рет қаралды 15 МЛН