1.1 --- a/test/test_tools.h	Fri Oct 07 11:05:08 2005 +0000
     1.2 +++ b/test/test_tools.h	Fri Oct 07 11:05:35 2005 +0000
     1.3 @@ -129,33 +129,33 @@
     1.4    }  
     1.5  }
     1.6  
     1.7 -///Structure returned by \ref addSymPetersen().
     1.8 +///Structure returned by \ref addUndirPetersen().
     1.9  
    1.10 -///Structure returned by \ref addSymPetersen().
    1.11 +///Structure returned by \ref addUndirPetersen().
    1.12  ///
    1.13 -template<class Graph> struct SymPetStruct
    1.14 +template<class Graph> struct UndirPetStruct
    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::SymEdge> incir;
    1.22 +  std::vector<typename Graph::UndirEdge> incir;
    1.23    ///Vector containing the edges of the outer circle.
    1.24 -  std::vector<typename Graph::SymEdge> outcir;
    1.25 +  std::vector<typename Graph::UndirEdge> outcir;
    1.26    ///Vector containing the chord edges.
    1.27 -  std::vector<typename Graph::SymEdge> chords;
    1.28 +  std::vector<typename Graph::UndirEdge> chords;
    1.29  };
    1.30  
    1.31 -///Adds a Petersen graph to the symmetric \c G.
    1.32 +///Adds a Petersen graph to the undirected \c G.
    1.33  
    1.34 -///Adds a Petersen graph to the symmetric \c G.
    1.35 +///Adds a Petersen graph to the undirected \c G.
    1.36  ///\return The nodes and edges of the generated graph.
    1.37  
    1.38  template<typename Graph>
    1.39 -SymPetStruct<Graph> addSymPetersen(Graph &G,int num=5)
    1.40 +UndirPetStruct<Graph> addUndirPetersen(Graph &G,int num=5)
    1.41  {
    1.42 -  SymPetStruct<Graph> n;
    1.43 +  UndirPetStruct<Graph> n;
    1.44  
    1.45    for(int i=0;i<num;i++) {
    1.46      n.outer.push_back(G.addNode());