1.1 --- a/src/test/max_matching_test.cc	Thu Jan 20 14:16:40 2005 +0000
     1.2 +++ b/src/test/max_matching_test.cc	Tue Jan 25 17:39:24 2005 +0000
     1.3 @@ -22,8 +22,9 @@
     1.4  #include "test_tools.h"
     1.5  #include <lemon/invalid.h>
     1.6  #include <lemon/list_graph.h>
     1.7 -#include <graph_gen.h>
     1.8 -#include <max_matching.h>
     1.9 +#include <lemon/max_matching.h>
    1.10 +//temporarily
    1.11 +#include <work/jacint/graph_gen.h>
    1.12  
    1.13  using namespace std;
    1.14  using namespace lemon;
    1.15 @@ -53,13 +54,16 @@
    1.16      if ( mate[v]!=INVALID ) ++s;
    1.17    }
    1.18    int size=(int)s/2;  //size will be used as the size of a maxmatching
    1.19 -  
    1.20 +
    1.21 +  for(NodeIt v(G); v!=INVALID; ++v) {
    1.22 +    max_matching.mate(v);
    1.23 +  }
    1.24 +
    1.25    check ( size == max_matching.size(), "mate() returns a different size matching than max_matching.size()" );
    1.26  
    1.27    Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos0(G);
    1.28    max_matching.writePos(pos0);
    1.29    
    1.30 -  max_matching.resetPos();
    1.31    max_matching.resetMatching();
    1.32    max_matching.runEdmonds(1);
    1.33    s=0;
    1.34 @@ -72,7 +76,6 @@
    1.35    Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos1(G);
    1.36    max_matching.writePos(pos1);
    1.37  
    1.38 -  max_matching.resetPos();
    1.39    max_matching.run();
    1.40    s=0;
    1.41    max_matching.writeNMapNode(mate);
    1.42 @@ -84,7 +87,6 @@
    1.43    Graph::NodeMap<MaxMatching<Graph>::pos_enum> pos2(G);
    1.44    max_matching.writePos(pos2);
    1.45  
    1.46 -  max_matching.resetPos();
    1.47    max_matching.resetMatching();
    1.48    max_matching.run();
    1.49    s=0;