1.1 --- a/test/test_tools.h	Thu Jan 26 06:44:22 2006 +0000
     1.2 +++ b/test/test_tools.h	Thu Jan 26 15:42:13 2006 +0000
     1.3 @@ -133,22 +133,22 @@
     1.4    }  
     1.5  }
     1.6  
     1.7 -///Structure returned by \ref addUndirPetersen().
     1.8 +///Structure returned by \ref addUPetersen().
     1.9  
    1.10 -///Structure returned by \ref addUndirPetersen().
    1.11 +///Structure returned by \ref addUPetersen().
    1.12  ///
    1.13 -template<class Graph> struct UndirPetStruct
    1.14 +template<class Graph> struct UPetStruct
    1.15  {
    1.16    ///Vector containing the outer nodes.
    1.17    std::vector<typename Graph::Node> outer;
    1.18    ///Vector containing the inner nodes.
    1.19    std::vector<typename Graph::Node> inner;
    1.20    ///Vector containing the edges of the inner circle.
    1.21 -  std::vector<typename Graph::UndirEdge> incir;
    1.22 +  std::vector<typename Graph::UEdge> incir;
    1.23    ///Vector containing the edges of the outer circle.
    1.24 -  std::vector<typename Graph::UndirEdge> outcir;
    1.25 +  std::vector<typename Graph::UEdge> outcir;
    1.26    ///Vector containing the chord edges.
    1.27 -  std::vector<typename Graph::UndirEdge> chords;
    1.28 +  std::vector<typename Graph::UEdge> chords;
    1.29  };
    1.30  
    1.31  ///Adds a Petersen graph to the undirected \c G.
    1.32 @@ -157,9 +157,9 @@
    1.33  ///\return The nodes and edges of the generated graph.
    1.34  
    1.35  template<typename Graph>
    1.36 -UndirPetStruct<Graph> addUndirPetersen(Graph &G,int num=5)
    1.37 +UPetStruct<Graph> addUPetersen(Graph &G,int num=5)
    1.38  {
    1.39 -  UndirPetStruct<Graph> n;
    1.40 +  UPetStruct<Graph> n;
    1.41  
    1.42    for(int i=0;i<num;i++) {
    1.43      n.outer.push_back(G.addNode());