Maximum Matching Algorithm

Topics: algorithm, graph
Sep 23, 2010 at 10:46 AM

Hi everyone

I want to use MaximumBipartiteMatchingAlgorithm To find the Maximum matching of an UndirectedGraph.

Please give me a short sample code for this.

Thank You

for example I have & i want to apply the algorithm to this:

UndirectedGraph
> Gstar=new UndirectedGraph>(false); 
Gstar.AddVertex(
"1,1");
Gstar.AddVertex(
"1,2"); 
Gstar.AddVertex(
"2,1"); 
Gstar.AddVertex(
"2,2"); 
Gstar.AddEdge(
new Edge("1,1","1,2")); 
Gstar.AddEdge(
new Edge("1,2", "1,1")); 
Gstar.AddEdge(
new Edge("1,1", "2,1")); 
Gstar.AddEdge(
new Edge("2,1", "1,1")); 
Gstar.AddEdge(
new Edge("1,2", "2,2")); 
Gstar.AddEdge(
new Edge("2,2", "1,2")); 
Gstar.AddEdge(
new Edge("2,1", "2,2")); 
Gstar.AddEdge(
new Edge("2,2", "2,1"));

 

Developer
Sep 23, 2010 at 5:45 PM

Download the source code, and then search for the unit test that calls MaximumBipartiteMatchingAlgorithm.  This should serve as an example of how it's used.

Sep 29, 2010 at 9:39 AM
Edited Sep 29, 2010 at 10:01 AM

Thank you very much.  but in the unit test a constructor is used which takes 5 arguments but the original constructor takes 3 arguments .can you explain please

i found that you fixed this bug sorry it may be a dumb question but how can i fix it using the .dll files as refrences?

Sep 29, 2010 at 9:39 PM
Edited Sep 29, 2010 at 9:39 PM

sorry but I'm doing an achademic project with your prouct , can you release a new version???