diff -r e225719bde6b -r 2d806130e700 test/test_tools.h
--- a/test/test_tools.h	Thu Jan 26 06:44:22 2006 +0000
+++ b/test/test_tools.h	Thu Jan 26 15:42:13 2006 +0000
@@ -133,22 +133,22 @@
   }  
 }
 
-///Structure returned by \ref addUndirPetersen().
+///Structure returned by \ref addUPetersen().
 
-///Structure returned by \ref addUndirPetersen().
+///Structure returned by \ref addUPetersen().
 ///
-template<class Graph> struct UndirPetStruct
+template<class Graph> struct UPetStruct
 {
   ///Vector containing the outer nodes.
   std::vector<typename Graph::Node> outer;
   ///Vector containing the inner nodes.
   std::vector<typename Graph::Node> inner;
   ///Vector containing the edges of the inner circle.
-  std::vector<typename Graph::UndirEdge> incir;
+  std::vector<typename Graph::UEdge> incir;
   ///Vector containing the edges of the outer circle.
-  std::vector<typename Graph::UndirEdge> outcir;
+  std::vector<typename Graph::UEdge> outcir;
   ///Vector containing the chord edges.
-  std::vector<typename Graph::UndirEdge> chords;
+  std::vector<typename Graph::UEdge> chords;
 };
 
 ///Adds a Petersen graph to the undirected \c G.
@@ -157,9 +157,9 @@
 ///\return The nodes and edges of the generated graph.
 
 template<typename Graph>
-UndirPetStruct<Graph> addUndirPetersen(Graph &G,int num=5)
+UPetStruct<Graph> addUPetersen(Graph &G,int num=5)
 {
-  UndirPetStruct<Graph> n;
+  UPetStruct<Graph> n;
 
   for(int i=0;i<num;i++) {
     n.outer.push_back(G.addNode());