Thank you! I was really having trouble understanding the augmenting path concept and the whole Hopcroft-Karp algorithm as a whole before this video but you changed that. Thanks mate 👍🏽
At 6:14 How did you prevent the algorithm from traversing 5-J=2-L ? If this had been picked, then it would have prevented further matching within that iteration.
Picking the path (5-J=2-L) wouldn't have been wrong. Because if you do the rough work, then after considering that path, there will still be an augmenting path left, so we'll go into the next iteration, and for the next iteration, the augmenting path would be (4-J=5-T=6-R) with length 6 now. And after considering this path, the result would be the same as is in the video.
Hello! Is there an explanation to the order of each list of tasks a worker has? For the first matching, why not B-1, E-3, J-2, L-7, T-5, A-6, Raj free? The result of the algorithm will be different in this case.
Thanks for video, it was very helpfull. But its hard me to understand you, cos i am bad at lisening Eanglish , can you put more text information and tips on your videos?. Thanks again
Please connect J - and 4 in the starting diagram , where all the vertices are unmatched. then BFS will also change ... entire explanation might have to be changed ... although thanks for tutorial.
![โรงเรียนห้ามรัก โดนจับได้ตาย...!! [เอิร์นไดเม่]](http://i.ytimg.com/vi/4u02Sbr556Q/mqdefault.jpg)
![ตีสิบเดย์ [FULL] | เปิดใจ "อาจารย์ เบียร์ ฅนตื่นธรรม" นักสนทนาธรรมสายดุดัน!](http://i.ytimg.com/vi/vqaBI_mnoDk/mqdefault.jpg)
Thank you! I was really having trouble understanding the augmenting path concept and the whole Hopcroft-Karp algorithm as a whole before this video but you changed that. Thanks mate 👍🏽
Thank you for explaining this comprehendible!
Great Explanation! Thank you! looking around for an example was hell
Clearly explained! Thank you!
Thanks for the clear explanation.
Thank you, very good explanations!
At 6:14 How did you prevent the algorithm from traversing 5-J=2-L ? If this had been picked, then it would have prevented further matching within that iteration.
Picking the path (5-J=2-L) wouldn't have been wrong. Because if you do the rough work, then after considering that path, there will still be an augmenting path left, so we'll go into the next iteration, and for the next iteration, the augmenting path would be (4-J=5-T=6-R) with length 6 now. And after considering this path, the result would be the same as is in the video.
Hello! Is there an explanation to the order of each list of tasks a worker has? For the first matching, why not B-1, E-3, J-2, L-7, T-5, A-6, Raj free? The result of the algorithm will be different in this case.
nah it is just a greedy algorithm it just chooses first thing then go on
Really helpful, thank you so much!
Why can't we just use the n as iteration number, what's the point of using the root v?
hello, can this algorithm be applied if there is rules about set A elements, for example Anna and Emily can't work together?
minute 4:12
really amazing....u should post more videos
What is the root v represent about, still confusing
thank you so much
Can u pls prove the lemma 1 and 2 for me ? Thanks in advanced 😅
Uhm... best explanation on the web? :))
You bet!
Thanks for video, it was very helpfull. But its hard me to understand you, cos i am bad at lisening Eanglish , can you put more text information and tips on your videos?. Thanks again
Thank you very much
Just a nitpick, but this algorithm finds a maximum matching, not a maximal one
Thank you so much. Would you please give us, and explain the worst case of Hopcroft-Karp algorithm?
super clear
Please connect J - and 4 in the starting diagram , where all the vertices are unmatched.
then BFS will also change ... entire explanation might have to be changed ...
although thanks for tutorial.
nice vid
Not at all got .please elaborate more deeply.
Finish your words, for some reason you start muting yourself near the end of a words.