[906] | 1 | /* -*- C++ -*- |
---|
| 2 | * src/test/graph_test.cc - Part of HUGOlib, a generic C++ optimization library |
---|
| 3 | * |
---|
| 4 | * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
| 5 | * (Egervary Combinatorial Optimization Research Group, EGRES). |
---|
| 6 | * |
---|
| 7 | * Permission to use, modify and distribute this software is granted |
---|
| 8 | * provided that this copyright notice appears in all copies. For |
---|
| 9 | * precise terms see the accompanying LICENSE file. |
---|
| 10 | * |
---|
| 11 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 12 | * express or implied, and with no claim as to its suitability for any |
---|
| 13 | * purpose. |
---|
| 14 | * |
---|
| 15 | */ |
---|
| 16 | |
---|
[503] | 17 | #include<iostream> |
---|
[542] | 18 | #include<hugo/smart_graph.h> |
---|
[564] | 19 | #include<hugo/skeletons/graph.h> |
---|
[578] | 20 | #include<hugo/list_graph.h> |
---|
[592] | 21 | #include<hugo/full_graph.h> |
---|
[578] | 22 | |
---|
[567] | 23 | #include"test_tools.h" |
---|
[800] | 24 | #include"graph_test.h" |
---|
[567] | 25 | |
---|
[774] | 26 | /** |
---|
| 27 | \file |
---|
[503] | 28 | This test makes consistency checks of list graph structures. |
---|
| 29 | |
---|
[774] | 30 | G.addNode(), G.addEdge(), G.tail(), G.head() |
---|
[503] | 31 | |
---|
[592] | 32 | \todo Checks for empty graphs and isolated points. |
---|
[774] | 33 | conversion. |
---|
[503] | 34 | */ |
---|
| 35 | |
---|
| 36 | using namespace hugo; |
---|
| 37 | |
---|
| 38 | template<class Graph> void bidirPetersen(Graph &G) |
---|
| 39 | { |
---|
| 40 | typedef typename Graph::Edge Edge; |
---|
| 41 | typedef typename Graph::EdgeIt EdgeIt; |
---|
| 42 | |
---|
[800] | 43 | checkGraphEdgeList(G,15); |
---|
[503] | 44 | |
---|
| 45 | std::vector<Edge> ee; |
---|
| 46 | |
---|
[774] | 47 | for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e); |
---|
[503] | 48 | |
---|
| 49 | for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++) |
---|
| 50 | G.addEdge(G.head(*p),G.tail(*p)); |
---|
| 51 | } |
---|
| 52 | |
---|
| 53 | template<class Graph> void checkPetersen(Graph &G) |
---|
| 54 | { |
---|
| 55 | typedef typename Graph::Node Node; |
---|
| 56 | |
---|
| 57 | typedef typename Graph::EdgeIt EdgeIt; |
---|
| 58 | typedef typename Graph::NodeIt NodeIt; |
---|
| 59 | |
---|
[800] | 60 | checkGraphNodeList(G,10); |
---|
| 61 | checkGraphEdgeList(G,30); |
---|
[503] | 62 | |
---|
[774] | 63 | for(NodeIt n(G);n!=INVALID;++n) { |
---|
[800] | 64 | checkGraphInEdgeList(G,n,3); |
---|
| 65 | checkGraphOutEdgeList(G,n,3); |
---|
[503] | 66 | } |
---|
| 67 | } |
---|
| 68 | |
---|
[880] | 69 | //Compile Graph |
---|
| 70 | template void hugo::checkCompileStaticGraph<skeleton::StaticGraph> |
---|
| 71 | (skeleton::StaticGraph &); |
---|
[793] | 72 | |
---|
[880] | 73 | template void hugo::checkCompileGraph<skeleton::ExtendableGraph> |
---|
| 74 | (skeleton::ExtendableGraph &); |
---|
[793] | 75 | |
---|
[880] | 76 | template void hugo::checkCompileErasableGraph<skeleton::ErasableGraph> |
---|
| 77 | (skeleton::ErasableGraph &); |
---|
[733] | 78 | |
---|
[774] | 79 | //Compile SmartGraph |
---|
[873] | 80 | template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &); |
---|
| 81 | template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &); |
---|
[783] | 82 | |
---|
[774] | 83 | //Compile SymSmartGraph |
---|
[909] | 84 | //template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &); |
---|
| 85 | //template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &); |
---|
[774] | 86 | |
---|
| 87 | //Compile ListGraph |
---|
[873] | 88 | template void hugo::checkCompileGraph<ListGraph>(ListGraph &); |
---|
| 89 | template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &); |
---|
| 90 | template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &); |
---|
[774] | 91 | |
---|
[783] | 92 | |
---|
[774] | 93 | //Compile SymListGraph |
---|
[909] | 94 | //template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &); |
---|
| 95 | //template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &); |
---|
| 96 | //template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &); |
---|
[774] | 97 | |
---|
| 98 | //Compile FullGraph |
---|
[873] | 99 | template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &); |
---|
| 100 | template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &); |
---|
[550] | 101 | |
---|
[774] | 102 | //Compile EdgeSet <ListGraph> |
---|
[873] | 103 | template void hugo::checkCompileGraph<EdgeSet <ListGraph> > |
---|
[800] | 104 | (EdgeSet <ListGraph> &); |
---|
[873] | 105 | template void hugo::checkCompileGraphEraseEdge<EdgeSet <ListGraph> > |
---|
| 106 | (EdgeSet <ListGraph> &); |
---|
| 107 | template void hugo::checkCompileGraphFindEdge<EdgeSet <ListGraph> > |
---|
[800] | 108 | (EdgeSet <ListGraph> &); |
---|
[774] | 109 | |
---|
| 110 | //Compile EdgeSet <NodeSet> |
---|
[873] | 111 | template void hugo::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &); |
---|
| 112 | template void hugo::checkCompileGraphEraseEdge<EdgeSet <NodeSet> > |
---|
[800] | 113 | (EdgeSet <NodeSet> &); |
---|
[873] | 114 | template void hugo::checkCompileGraphFindEdge<EdgeSet <NodeSet> > |
---|
[800] | 115 | (EdgeSet <NodeSet> &); |
---|
[774] | 116 | |
---|
[503] | 117 | |
---|
| 118 | int main() |
---|
| 119 | { |
---|
| 120 | { |
---|
| 121 | SmartGraph G; |
---|
| 122 | addPetersen(G); |
---|
| 123 | bidirPetersen(G); |
---|
| 124 | checkPetersen(G); |
---|
| 125 | } |
---|
[578] | 126 | { |
---|
| 127 | ListGraph G; |
---|
| 128 | addPetersen(G); |
---|
| 129 | bidirPetersen(G); |
---|
| 130 | checkPetersen(G); |
---|
| 131 | } |
---|
[503] | 132 | { |
---|
[909] | 133 | // SymSmartGraph G; |
---|
| 134 | // addPetersen(G); |
---|
| 135 | // checkPetersen(G); |
---|
[503] | 136 | } |
---|
[578] | 137 | { |
---|
[909] | 138 | // SymListGraph G; |
---|
| 139 | // addPetersen(G); |
---|
| 140 | // checkPetersen(G); |
---|
[578] | 141 | } |
---|
[503] | 142 | |
---|
[774] | 143 | ///\file |
---|
| 144 | ///\todo map tests. |
---|
| 145 | ///\todo copy constr tests. |
---|
[503] | 146 | |
---|
| 147 | std::cout << __FILE__ ": All tests passed.\n"; |
---|
| 148 | |
---|
[579] | 149 | return 0; |
---|
[503] | 150 | } |
---|