src/test/graph_test.cc
author alpar
Mon, 13 Sep 2004 11:24:35 +0000
changeset 835 eb9587f09b42
parent 800 b70a494b4912
child 873 f3a30fda2e49
permissions -rw-r--r--
Remove one remaining range checking.
     1 #include<iostream>
     2 #include<hugo/smart_graph.h>
     3 #include<hugo/skeletons/graph.h>
     4 #include<hugo/list_graph.h>
     5 #include<hugo/full_graph.h>
     6 
     7 #include"test_tools.h"
     8 #include"graph_test.h"
     9 
    10 /**
    11 \file
    12 This test makes consistency checks of list graph structures.
    13 
    14 G.addNode(), G.addEdge(), G.tail(), G.head()
    15 
    16 \todo Checks for empty graphs and isolated points.
    17 conversion.
    18 */
    19 
    20 using namespace hugo;
    21 
    22 template<class Graph> void bidirPetersen(Graph &G)
    23 {
    24   typedef typename Graph::Edge Edge;
    25   typedef typename Graph::EdgeIt EdgeIt;
    26   
    27   checkGraphEdgeList(G,15);
    28   
    29   std::vector<Edge> ee;
    30   
    31   for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);
    32 
    33   for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)
    34     G.addEdge(G.head(*p),G.tail(*p));
    35 }
    36 
    37 template<class Graph> void checkPetersen(Graph &G)
    38 {
    39   typedef typename Graph::Node Node;
    40 
    41   typedef typename Graph::EdgeIt EdgeIt;
    42   typedef typename Graph::NodeIt NodeIt;
    43 
    44   checkGraphNodeList(G,10);
    45   checkGraphEdgeList(G,30);
    46 
    47   for(NodeIt n(G);n!=INVALID;++n) {
    48     checkGraphInEdgeList(G,n,3);
    49     checkGraphOutEdgeList(G,n,3);
    50     ++n;
    51   }  
    52 }
    53 
    54 //Compile GraphSkeleton
    55 template void checkCompileStaticGraph<skeleton::StaticGraphSkeleton>
    56 (skeleton::StaticGraphSkeleton &);
    57 
    58 template void checkCompileGraph<skeleton::GraphSkeleton>
    59 (skeleton::GraphSkeleton &);
    60 
    61 template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
    62 (skeleton::ErasableGraphSkeleton &);
    63 
    64 //Compile SmartGraph
    65 template void checkCompileGraph<SmartGraph>(SmartGraph &);
    66 template void checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
    67 
    68 //Compile SymSmartGraph
    69 template void checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
    70 template void checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    71 
    72 //Compile ListGraph
    73 template void checkCompileGraph<ListGraph>(ListGraph &);
    74 template void checkCompileErasableGraph<ListGraph>(ListGraph &);
    75 template void checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    76 
    77 
    78 //Compile SymListGraph
    79 template void checkCompileGraph<SymListGraph>(SymListGraph &);
    80 template void checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    81 template void checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    82 
    83 //Compile FullGraph
    84 template void checkCompileStaticGraph<FullGraph>(FullGraph &);
    85 template void checkCompileGraphFindEdge<FullGraph>(FullGraph &);
    86 
    87 //Compile EdgeSet <ListGraph>
    88 template void checkCompileGraph<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
    89 template void checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
    90 (EdgeSet <ListGraph> &);
    91 template void checkCompileGraphFindEdge<EdgeSet <ListGraph> >
    92 (EdgeSet <ListGraph> &);
    93 
    94 //Compile EdgeSet <NodeSet>
    95 template void checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
    96 template void checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
    97 (EdgeSet <NodeSet> &);
    98 template void checkCompileGraphFindEdge<EdgeSet <NodeSet> >
    99 (EdgeSet <NodeSet> &);
   100 
   101 
   102 int main() 
   103 {
   104   {
   105     SmartGraph G;
   106     addPetersen(G);
   107     bidirPetersen(G);
   108     checkPetersen(G);
   109   }
   110   {
   111     ListGraph G;
   112     addPetersen(G);
   113     bidirPetersen(G);
   114     checkPetersen(G);
   115   }
   116   {
   117     SymSmartGraph G;
   118     addPetersen(G);
   119     checkPetersen(G);
   120   }
   121   {
   122     SymListGraph G;
   123     addPetersen(G);
   124     checkPetersen(G);
   125   }
   126 
   127   ///\file
   128   ///\todo map tests.
   129   ///\todo copy constr tests.
   130 
   131   std::cout << __FILE__ ": All tests passed.\n";
   132 
   133   return 0;
   134 }