src/test/graph_test.cc
changeset 578 159f1cbf8a45
parent 567 efaa79ee8d14
child 579 859f8c7e2a40
equal deleted inserted replaced
6:54de831ab9b4 7:6ff85549a2b5
     1 #include<iostream>
     1 #include<iostream>
     2 #include<hugo/smart_graph.h>
     2 #include<hugo/smart_graph.h>
     3 #include<hugo/skeletons/graph.h>
     3 #include<hugo/skeletons/graph.h>
       
     4 #include<hugo/list_graph.h>
       
     5 
     4 #include"test_tools.h"
     6 #include"test_tools.h"
     5 
       
     6 //#include<../work/alpar/list_graph.h>
       
     7 
     7 
     8 /*
     8 /*
     9 This test makes consistency checks of list graph structures.
     9 This test makes consistency checks of list graph structures.
    10 
    10 
    11 G.addNode(), G.addEdge(), G.valid(), G.tail(), G.head()
    11 G.addNode(), G.addEdge(), G.valid(), G.tail(), G.head()
   240 }
   240 }
   241 
   241 
   242 template void checkCompile<GraphSkeleton>(GraphSkeleton &);
   242 template void checkCompile<GraphSkeleton>(GraphSkeleton &);
   243 template void checkCompile<SmartGraph>(SmartGraph &);
   243 template void checkCompile<SmartGraph>(SmartGraph &);
   244 template void checkCompile<SymSmartGraph>(SymSmartGraph &);
   244 template void checkCompile<SymSmartGraph>(SymSmartGraph &);
   245 //template void checkCompile<ListGraph>(ListGraph &);
   245 template void checkCompile<ListGraph>(ListGraph &);
   246 //template void checkCompile<SymListGraph>(SymListGraph &);
   246 template void checkCompile<SymListGraph>(SymListGraph &);
   247 
   247 
   248 //Due to some mysterious and some conceptual problems it does not work.
   248 //Due to some mysterious and some conceptual problems it does not work.
   249 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
   249 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
   250 
   250 
   251 int main() 
   251 int main() 
   254     SmartGraph G;
   254     SmartGraph G;
   255     addPetersen(G);
   255     addPetersen(G);
   256     bidirPetersen(G);
   256     bidirPetersen(G);
   257     checkPetersen(G);
   257     checkPetersen(G);
   258   }
   258   }
   259 //   {
   259   {
   260 //     ListGraph G;
   260     ListGraph G;
   261 //     addPetersen(G);
   261     addPetersen(G);
   262 //     bidirPetersen(G);
   262     bidirPetersen(G);
   263 //     checkPetersen(G);
   263     checkPetersen(G);
   264 //   }
   264   }
   265   {
   265   {
   266     SymSmartGraph G;
   266     SymSmartGraph G;
   267     addPetersen(G);
   267     addPetersen(G);
   268     checkPetersen(G);
   268     checkPetersen(G);
   269   }
   269   }
   270 //   {
   270   {
   271 //     SymListGraph G;
   271     SymListGraph G;
   272 //     addPetersen(G);
   272     addPetersen(G);
   273 //     checkPetersen(G);
   273     checkPetersen(G);
   274 //   }
   274   }
   275 
   275 
   276   //\todo map tests.
   276   //\todo map tests.
   277   //\todo copy constr tests.
   277   //\todo copy constr tests.
   278 
   278 
   279   std::cout << __FILE__ ": All tests passed.\n";
   279   std::cout << __FILE__ ": All tests passed.\n";