1.1 --- a/test/max_matching_test.cc	Thu Jan 26 06:44:22 2006 +0000
     1.2 +++ b/test/max_matching_test.cc	Thu Jan 26 15:42:13 2006 +0000
     1.3 @@ -31,10 +31,10 @@
     1.4  
     1.5  int main() {
     1.6  
     1.7 -  typedef UndirListGraph Graph;
     1.8 +  typedef ListUGraph Graph;
     1.9  
    1.10    typedef Graph::Edge Edge;
    1.11 -  typedef Graph::UndirEdgeIt UndirEdgeIt;
    1.12 +  typedef Graph::UEdgeIt UEdgeIt;
    1.13    typedef Graph::IncEdgeIt IncEdgeIt;
    1.14    typedef Graph::NodeIt NodeIt;
    1.15    typedef Graph::Node Node;
    1.16 @@ -138,7 +138,7 @@
    1.17    check ( coincide, "The decompositions do not coincide! " );
    1.18  
    1.19    bool noedge=true;
    1.20 -  for(UndirEdgeIt e(g); e!=INVALID; ++e) {
    1.21 +  for(UEdgeIt e(g); e!=INVALID; ++e) {
    1.22     if ( (pos[g.target(e)]==max_matching.C && pos[g.source(e)]==max_matching.D) || 
    1.23  	 (pos[g.target(e)]==max_matching.D && pos[g.source(e)]==max_matching.C) )
    1.24        noedge=false;