Search:

Sorry for that thread guys. I 've started implementing the algorithm. If l need help l 'll post a new one.

Given a bipartite graph G = (V, E) with bipartition (A, B) and a weight in every edge of the graph it finds the matching of maximum weight.

Hi guys.
Any ideas on how to implement the "Maximum Weigth Matching" algorithm?
Pseudocode or any sources would be appreciated.
Thanks a lot.