1.1 --- a/src/test/graph_test.cc Fri May 07 11:57:34 2004 +0000
1.2 +++ b/src/test/graph_test.cc Fri May 07 13:27:16 2004 +0000
1.3 @@ -1,10 +1,10 @@
1.4 #include<iostream>
1.5 #include<hugo/smart_graph.h>
1.6 #include<hugo/skeletons/graph.h>
1.7 +#include<hugo/list_graph.h>
1.8 +
1.9 #include"test_tools.h"
1.10
1.11 -//#include<../work/alpar/list_graph.h>
1.12 -
1.13 /*
1.14 This test makes consistency checks of list graph structures.
1.15
1.16 @@ -242,8 +242,8 @@
1.17 template void checkCompile<GraphSkeleton>(GraphSkeleton &);
1.18 template void checkCompile<SmartGraph>(SmartGraph &);
1.19 template void checkCompile<SymSmartGraph>(SymSmartGraph &);
1.20 -//template void checkCompile<ListGraph>(ListGraph &);
1.21 -//template void checkCompile<SymListGraph>(SymListGraph &);
1.22 +template void checkCompile<ListGraph>(ListGraph &);
1.23 +template void checkCompile<SymListGraph>(SymListGraph &);
1.24
1.25 //Due to some mysterious and some conceptual problems it does not work.
1.26 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
1.27 @@ -256,22 +256,22 @@
1.28 bidirPetersen(G);
1.29 checkPetersen(G);
1.30 }
1.31 -// {
1.32 -// ListGraph G;
1.33 -// addPetersen(G);
1.34 -// bidirPetersen(G);
1.35 -// checkPetersen(G);
1.36 -// }
1.37 + {
1.38 + ListGraph G;
1.39 + addPetersen(G);
1.40 + bidirPetersen(G);
1.41 + checkPetersen(G);
1.42 + }
1.43 {
1.44 SymSmartGraph G;
1.45 addPetersen(G);
1.46 checkPetersen(G);
1.47 }
1.48 -// {
1.49 -// SymListGraph G;
1.50 -// addPetersen(G);
1.51 -// checkPetersen(G);
1.52 -// }
1.53 + {
1.54 + SymListGraph G;
1.55 + addPetersen(G);
1.56 + checkPetersen(G);
1.57 + }
1.58
1.59 //\todo map tests.
1.60 //\todo copy constr tests.