diff -r e8703f0a6e2f -r 159f1cbf8a45 src/test/graph_test.cc
--- a/src/test/graph_test.cc	Fri May 07 11:57:34 2004 +0000
+++ b/src/test/graph_test.cc	Fri May 07 13:27:16 2004 +0000
@@ -1,10 +1,10 @@
 #include<iostream>
 #include<hugo/smart_graph.h>
 #include<hugo/skeletons/graph.h>
+#include<hugo/list_graph.h>
+
 #include"test_tools.h"
 
-//#include<../work/alpar/list_graph.h>
-
 /*
 This test makes consistency checks of list graph structures.
 
@@ -242,8 +242,8 @@
 template void checkCompile<GraphSkeleton>(GraphSkeleton &);
 template void checkCompile<SmartGraph>(SmartGraph &);
 template void checkCompile<SymSmartGraph>(SymSmartGraph &);
-//template void checkCompile<ListGraph>(ListGraph &);
-//template void checkCompile<SymListGraph>(SymListGraph &);
+template void checkCompile<ListGraph>(ListGraph &);
+template void checkCompile<SymListGraph>(SymListGraph &);
 
 //Due to some mysterious and some conceptual problems it does not work.
 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
@@ -256,22 +256,22 @@
     bidirPetersen(G);
     checkPetersen(G);
   }
-//   {
-//     ListGraph G;
-//     addPetersen(G);
-//     bidirPetersen(G);
-//     checkPetersen(G);
-//   }
+  {
+    ListGraph G;
+    addPetersen(G);
+    bidirPetersen(G);
+    checkPetersen(G);
+  }
   {
     SymSmartGraph G;
     addPetersen(G);
     checkPetersen(G);
   }
-//   {
-//     SymListGraph G;
-//     addPetersen(G);
-//     checkPetersen(G);
-//   }
+  {
+    SymListGraph G;
+    addPetersen(G);
+    checkPetersen(G);
+  }
 
   //\todo map tests.
   //\todo copy constr tests.