1.1 --- a/src/test/graph_test.cc Wed Sep 29 10:35:35 2004 +0000
1.2 +++ b/src/test/graph_test.cc Wed Sep 29 14:02:14 2004 +0000
1.3 @@ -63,6 +63,7 @@
1.4 for(NodeIt n(G);n!=INVALID;++n) {
1.5 checkGraphInEdgeList(G,n,3);
1.6 checkGraphOutEdgeList(G,n,3);
1.7 + ++n;
1.8 }
1.9 }
1.10
1.11 @@ -81,8 +82,8 @@
1.12 template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
1.13
1.14 //Compile SymSmartGraph
1.15 -//template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
1.16 -//template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
1.17 +template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
1.18 +template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
1.19
1.20 //Compile ListGraph
1.21 template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
1.22 @@ -91,9 +92,9 @@
1.23
1.24
1.25 //Compile SymListGraph
1.26 -//template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
1.27 -//template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
1.28 -//template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
1.29 +template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
1.30 +template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
1.31 +template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
1.32
1.33 //Compile FullGraph
1.34 template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
1.35 @@ -130,14 +131,14 @@
1.36 checkPetersen(G);
1.37 }
1.38 {
1.39 - // SymSmartGraph G;
1.40 - // addPetersen(G);
1.41 - // checkPetersen(G);
1.42 + SymSmartGraph G;
1.43 + addPetersen(G);
1.44 + checkPetersen(G);
1.45 }
1.46 {
1.47 - // SymListGraph G;
1.48 - // addPetersen(G);
1.49 - // checkPetersen(G);
1.50 + SymListGraph G;
1.51 + addPetersen(G);
1.52 + checkPetersen(G);
1.53 }
1.54
1.55 ///\file