Hello all ,↵
Lately I am trying to learn more about kuhn's algorithm ,↵
But whenever I type "Kuhn's Algorithm" on google the result shows "Hungarian Algorithm"↵
↵
So I thought both of them are the same , ↵
↵
After some surfing on topcoder blogs , I found that Kuhn's algorithm works in O(VE) whereas hungarian takes O(V^3) , so are they not same?!↵
↵
But the way it's given in the topcoder blog , I think that Kuhn's can only be applied on a bipartite graph when all the edge weights are same . . ↵
↵
Is it true , can Kuhn's only be applied when when all the edge weights are same?↵
↵
Also can someone tell me all the most used flow algorithms / matching algorithms and where to best study them from ?↵
So far I only know the basic Max Flow problem and the Kuhn's algorithm!↵
↵
The topcoder blog I studied from ==> [Matchings](https://apps.topcoder.com/forums/?module=Thread&threadID=684427&start=0&mc=13)↵
↵
Thanks for helping!↵
↵
Lately I am trying to learn more about kuhn's algorithm ,↵
But whenever I type "Kuhn's Algorithm" on google the result shows "Hungarian Algorithm"↵
↵
So I thought both of them are the same , ↵
↵
After some surfing on topcoder blogs , I found that Kuhn's algorithm works in O(VE) whereas hungarian takes O(V^3) , so are they not same?!↵
↵
But the way it's given in the topcoder blog , I think that Kuhn's can only be applied on a bipartite graph when all the edge weights are same . . ↵
↵
Is it true , can Kuhn's only be applied when when all the edge weights are same?↵
↵
Also can someone tell me all the most used flow algorithms / matching algorithms and where to best study them from ?↵
So far I only know the basic Max Flow problem and the Kuhn's algorithm!↵
↵
The topcoder blog I studied from ==> [Matchings](https://apps.topcoder.com/forums/?module=Thread&threadID=684427&start=0&mc=13)↵
↵
Thanks for helping!↵
↵
