Needed a simple understandable explanation of Hopcroft-Karp Maximum Matching Algorithm

I went through many articles, wiki page but I am not able to understand the concept behind it. I got the concept of augmenting path and how it increases by one every time untill max matching is found, but I am unable to understand how it is implemented using bfs and dfs given on wiki page. Thankyou

1 Like
//