1.1 --- a/src/work/marci/bipartite_matching_try_3.cc	Tue May 11 17:02:32 2004 +0000
     1.2 +++ b/src/work/marci/bipartite_matching_try_3.cc	Tue May 11 17:37:34 2004 +0000
     1.3 @@ -131,7 +131,7 @@
     1.4    ts.reset();
     1.5    FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); 
     1.6    FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); 
     1.7 -  MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 
     1.8 +  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 
     1.9      Graph::EdgeMap<int>, Graph::NodeMap<int> > 
    1.10      matching_test(g, ge1, gn1, gef, gnf);
    1.11    matching_test.run();
    1.12 @@ -146,7 +146,7 @@
    1.13    ts.reset();
    1.14    FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); 
    1.15    //FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); 
    1.16 -  MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 
    1.17 +  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 
    1.18      Graph::EdgeMap<int>, Graph::NodeMap<int> > 
    1.19      matching_test_1(g, ge1, gn1, gef/*, gnf*/);
    1.20    matching_test_1.run();