# HG changeset patch
# User alpar
# Date 1083907785 0
# Node ID f84611a14a33725ac86d5745e297351c693dbb6b
# Parent  9732e5fa423cf2bfa8ac915bec0d0734db294a31
skeleton tests turned on again.

diff -r 9732e5fa423c -r f84611a14a33 src/test/graph_test.cc
--- a/src/test/graph_test.cc	Thu May 06 23:05:01 2004 +0000
+++ b/src/test/graph_test.cc	Fri May 07 05:29:45 2004 +0000
@@ -1,6 +1,6 @@
 #include<iostream>
 #include<hugo/smart_graph.h>
-//#include<hugo/skeletons/graph.h>
+#include<hugo/skeletons/graph.h>
 //#include<../work/alpar/list_graph.h>
 
 /*
@@ -172,22 +172,29 @@
   
 }
 
-
-
-template<class Graph> void addPetersen(Graph &G)
+template<class Graph> struct PetNodes
 {
   std::vector<typename Graph::Node> outer, inner;
+  std::vector<typename Graph::Edge> outcir, incir, cons;
+};
+
+template<class Graph> PetNodes<Graph> addPetersen(Graph &G,int num=5)
+{
+  //std::vector<typename Graph::Node> outer, inner;
   
-  for(int i=0;i<5;i++) {
-    outer.push_back(G.addNode());
-    inner.push_back(G.addNode());
+  PetNodes<Graph> n;
+
+  for(int i=0;i<num;i++) {
+    n.outer.push_back(G.addNode());
+    n.inner.push_back(G.addNode());
   }
 
- for(int i=0;i<5;i++) {
-    G.addEdge(outer[i],inner[i]);
-    G.addEdge(outer[i],outer[(i+1)%5]);
-    G.addEdge(inner[i],inner[(i+2)%5]);
+ for(int i=0;i<num;i++) {
+   n.cons.push_back(G.addEdge(n.outer[i],n.inner[i]));
+   n.outcir.push_back(G.addEdge(n.outer[i],n.outer[(i+1)%5]));
+   n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2)%5]));
   }
+ return n;
 }
 
 template<class Graph> void checkNodeList(Graph &G, int nn)
@@ -269,7 +276,7 @@
   }  
 }
 
-//template void checkCompile<GraphSkeleton>(GraphSkeleton &);
+template void checkCompile<GraphSkeleton>(GraphSkeleton &);
 template void checkCompile<SmartGraph>(SmartGraph &);
 template void checkCompile<SymSmartGraph>(SymSmartGraph &);
 //template void checkCompile<ListGraph>(ListGraph &);
@@ -286,22 +293,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.