How can I implement a bipartite matching algorithm (probably based on a max-flow algorithm) in C or C++ ?
To be specific, I have this input in a file:
(M,F) –> where M represents id of MALE and F is id of FEMALE.
I need to find the maximum number of matches and show matched couples.
matches: 1&3 , 2&5
I have read in some books I can base this problem on a "maximum flow in a network" algorithm, but I couldn't find any specific info other than the sentence "this problem can be solved by …. algorithm".
I have little knowledge about max-flow, and dont know how to implement it either…