COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
09/17/04 14:23:09 (17 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1185
Message:

Graph wrapper tests added.

File:
1 moved

Legend:

Unmodified
Added
Removed
  • src/test/graph_wrapper_test.cc

    r873 r878  
    1111/**
    1212\file
    13 This test makes consistency checks of list graph structures.
     13This test makes consistency checks of graph wrappers.
    1414
    15 G.addNode(), G.addEdge(), G.tail(), G.head()
    16 
    17 \todo Checks for empty graphs and isolated points.
    18 conversion.
     15\todo More extensive tests are needed
    1916*/
    2017
    2118using namespace hugo;
    2219
    23 // template<class Graph> void bidirPetersen(Graph &G)
    24 // {
    25 //   typedef typename Graph::Edge Edge;
    26 //   typedef typename Graph::EdgeIt EdgeIt;
    27  
    28 //   checkGraphEdgeList(G,15);
    29  
    30 //   std::vector<Edge> ee;
    31  
    32 //   for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);
    33 
    34 //   for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)
    35 //     G.addEdge(G.head(*p),G.tail(*p));
    36 // }
    37 
    38 // template<class Graph> void checkPetersen(Graph &G)
    39 // {
    40 //   typedef typename Graph::Node Node;
    41 
    42 //   typedef typename Graph::EdgeIt EdgeIt;
    43 //   typedef typename Graph::NodeIt NodeIt;
    44 
    45 //   checkGraphNodeList(G,10);
    46 //   checkGraphEdgeList(G,30);
    47 
    48 //   for(NodeIt n(G);n!=INVALID;++n) {
    49 //     checkGraphInEdgeList(G,n,3);
    50 //     checkGraphOutEdgeList(G,n,3);
    51 //     ++n;
    52 //   } 
    53 // }
    54 
    55 // //Compile GraphSkeleton
    56 // template void checkCompileStaticGraph<skeleton::StaticGraphSkeleton>
    57 // (skeleton::StaticGraphSkeleton &);
    58 
    59 // template void checkCompileGraph<skeleton::ExtendableGraphSkeleton>
    60 // (skeleton::ExtendableGraphSkeleton &);
    61 
    62 // template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
    63 // (skeleton::ErasableGraphSkeleton &);
    6420
    6521//Compile SmartGraph
     
    7430//template void checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    7531
    76 // //Compile ListGraph
    77 // template void checkCompileGraph<ListGraph>(ListGraph &);
    78 // template void checkCompileErasableGraph<ListGraph>(ListGraph &);
    79 // template void checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    80 
    81 
    82 // //Compile SymListGraph
    83 // template void checkCompileGraph<SymListGraph>(SymListGraph &);
    84 // template void checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    85 // template void checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    86 
    87 // //Compile FullGraph
    88 // template void checkCompileStaticGraph<FullGraph>(FullGraph &);
    89 // template void checkCompileGraphFindEdge<FullGraph>(FullGraph &);
    90 
    91 // //Compile EdgeSet <ListGraph>
    92 // template void checkCompileGraph<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
    93 // template void checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
    94 // (EdgeSet <ListGraph> &);
    95 // template void checkCompileGraphFindEdge<EdgeSet <ListGraph> >
    96 // (EdgeSet <ListGraph> &);
    97 
    98 // //Compile EdgeSet <NodeSet>
    99 // template void checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
    100 // template void checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
    101 // (EdgeSet <NodeSet> &);
    102 // template void checkCompileGraphFindEdge<EdgeSet <NodeSet> >
    103 // (EdgeSet <NodeSet> &);
    104 
    10532
    10633int main()
    10734{
    108  //  {
    109 //     SmartGraph G;
    110 //     addPetersen(G);
    111 //     bidirPetersen(G);
    112 //     checkPetersen(G);
    113 //   }
    114 //   {
    115 //     ListGraph G;
    116 //     addPetersen(G);
    117 //     bidirPetersen(G);
    118 //     checkPetersen(G);
    119 //   }
    120 //   {
    121 //     SymSmartGraph G;
    122 //     addPetersen(G);
    123 //     checkPetersen(G);
    124 //   }
    125 //   {
    126 //     SymListGraph G;
    127 //     addPetersen(G);
    128 //     checkPetersen(G);
    129 //   }
    130 
    131   ///\file
    132   ///\todo map tests.
    133   ///\todo copy constr tests.
    134 
    13535  std::cout << __FILE__ ": All tests passed.\n";
    13636
Note: See TracChangeset for help on using the changeset viewer.