1.1 --- a/src/test/graph_factory_test.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/test/graph_factory_test.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -28,7 +28,7 @@
     1.4  \file
     1.5  This test makes consistency checks of list graph structures.
     1.6  
     1.7 -G.addNode(), G.addEdge(), G.tail(), G.head()
     1.8 +G.addNode(), G.addEdge(), G.source(), G.target()
     1.9  
    1.10  \todo Checks for empty graphs and isolated points.
    1.11  conversion.
    1.12 @@ -48,7 +48,7 @@
    1.13    for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);
    1.14  
    1.15    for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)
    1.16 -    G.addEdge(G.head(*p),G.tail(*p));
    1.17 +    G.addEdge(G.target(*p),G.source(*p));
    1.18  }
    1.19  
    1.20  template<class Graph> void checkPetersen(Graph &G)