Hi guys I'm recently trying to study the Hopcroft-Karp Algorithm that can compute the maximum matching of a bipartite graph in O(sqrt(n)*m) complexity.
However I find it not so easy to understand. Can anybody help me explaining how the algorithm works or give me a working implementation of HK algorithm? Many thanks and best regards, --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
