| 1 | /* adjacency_matrix_test.cpp source file |
|---|
| 2 | * |
|---|
| 3 | * Copyright Cromwell D. Enage 2004 |
|---|
| 4 | * |
|---|
| 5 | * Distributed under the Boost Software License, Version 1.0. (See |
|---|
| 6 | * accompanying file LICENSE_1_0.txt or copy at |
|---|
| 7 | * http://www.boost.org/LICENSE_1_0.txt) |
|---|
| 8 | */ |
|---|
| 9 | |
|---|
| 10 | /* |
|---|
| 11 | * Defines the std::ios class and std::cout, its global output instance. |
|---|
| 12 | */ |
|---|
| 13 | #include <iostream> |
|---|
| 14 | |
|---|
| 15 | /* |
|---|
| 16 | * Defines the boost::property_map class template and the boost::get and |
|---|
| 17 | * boost::put function templates. |
|---|
| 18 | */ |
|---|
| 19 | #include <boost/property_map.hpp> |
|---|
| 20 | |
|---|
| 21 | /* |
|---|
| 22 | * Defines the boost::graph_traits class template. |
|---|
| 23 | */ |
|---|
| 24 | #include <boost/graph/graph_traits.hpp> |
|---|
| 25 | |
|---|
| 26 | /* |
|---|
| 27 | * Defines the vertex and edge property tags. |
|---|
| 28 | */ |
|---|
| 29 | #include <boost/graph/properties.hpp> |
|---|
| 30 | |
|---|
| 31 | /* |
|---|
| 32 | * Defines the boost::adjacency_list class template and its associated |
|---|
| 33 | * non-member function templates. |
|---|
| 34 | */ |
|---|
| 35 | #include <boost/graph/adjacency_list.hpp> |
|---|
| 36 | |
|---|
| 37 | /* |
|---|
| 38 | * Defines the boost::adjacency_matrix class template and its associated |
|---|
| 39 | * non-member function templates. |
|---|
| 40 | */ |
|---|
| 41 | #include <boost/graph/adjacency_matrix.hpp> |
|---|
| 42 | |
|---|
| 43 | #include <boost/test/minimal.hpp> |
|---|
| 44 | |
|---|
| 45 | int test_main(int, char*[]) |
|---|
| 46 | { |
|---|
| 47 | // Use setS to keep out edges in order, so they match the adjacency_matrix. |
|---|
| 48 | typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS> |
|---|
| 49 | Graph1; |
|---|
| 50 | typedef boost::adjacency_matrix<boost::undirectedS> |
|---|
| 51 | Graph2; |
|---|
| 52 | typedef boost::property_map<Graph1, boost::vertex_index_t>::type |
|---|
| 53 | IndexMap1; |
|---|
| 54 | typedef boost::property_map<Graph2, boost::vertex_index_t>::type |
|---|
| 55 | IndexMap2; |
|---|
| 56 | |
|---|
| 57 | Graph1 g1(24); |
|---|
| 58 | Graph2 g2(24); |
|---|
| 59 | |
|---|
| 60 | boost::add_edge(boost::vertex(0, g1), boost::vertex(7, g1), g1); |
|---|
| 61 | boost::add_edge(boost::vertex(0, g2), boost::vertex(7, g2), g2); |
|---|
| 62 | boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); |
|---|
| 63 | boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); |
|---|
| 64 | boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); |
|---|
| 65 | boost::add_edge(boost::vertex(2, g2), boost::vertex(10, g2), g2); |
|---|
| 66 | boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); |
|---|
| 67 | boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); |
|---|
| 68 | boost::add_edge(boost::vertex(3, g1), boost::vertex(10, g1), g1); |
|---|
| 69 | boost::add_edge(boost::vertex(3, g2), boost::vertex(10, g2), g2); |
|---|
| 70 | boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); |
|---|
| 71 | boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); |
|---|
| 72 | boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); |
|---|
| 73 | boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); |
|---|
| 74 | boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); |
|---|
| 75 | boost::add_edge(boost::vertex(4, g2), boost::vertex(0, g2), g2); |
|---|
| 76 | boost::add_edge(boost::vertex(5, g1), boost::vertex(14, g1), g1); |
|---|
| 77 | boost::add_edge(boost::vertex(5, g2), boost::vertex(14, g2), g2); |
|---|
| 78 | boost::add_edge(boost::vertex(6, g1), boost::vertex(3, g1), g1); |
|---|
| 79 | boost::add_edge(boost::vertex(6, g2), boost::vertex(3, g2), g2); |
|---|
| 80 | boost::add_edge(boost::vertex(7, g1), boost::vertex(17, g1), g1); |
|---|
| 81 | boost::add_edge(boost::vertex(7, g2), boost::vertex(17, g2), g2); |
|---|
| 82 | boost::add_edge(boost::vertex(7, g1), boost::vertex(11, g1), g1); |
|---|
| 83 | boost::add_edge(boost::vertex(7, g2), boost::vertex(11, g2), g2); |
|---|
| 84 | boost::add_edge(boost::vertex(8, g1), boost::vertex(17, g1), g1); |
|---|
| 85 | boost::add_edge(boost::vertex(8, g2), boost::vertex(17, g2), g2); |
|---|
| 86 | boost::add_edge(boost::vertex(8, g1), boost::vertex(1, g1), g1); |
|---|
| 87 | boost::add_edge(boost::vertex(8, g2), boost::vertex(1, g2), g2); |
|---|
| 88 | boost::add_edge(boost::vertex(9, g1), boost::vertex(11, g1), g1); |
|---|
| 89 | boost::add_edge(boost::vertex(9, g2), boost::vertex(11, g2), g2); |
|---|
| 90 | boost::add_edge(boost::vertex(9, g1), boost::vertex(1, g1), g1); |
|---|
| 91 | boost::add_edge(boost::vertex(9, g2), boost::vertex(1, g2), g2); |
|---|
| 92 | boost::add_edge(boost::vertex(10, g1), boost::vertex(19, g1), g1); |
|---|
| 93 | boost::add_edge(boost::vertex(10, g2), boost::vertex(19, g2), g2); |
|---|
| 94 | boost::add_edge(boost::vertex(10, g1), boost::vertex(15, g1), g1); |
|---|
| 95 | boost::add_edge(boost::vertex(10, g2), boost::vertex(15, g2), g2); |
|---|
| 96 | boost::add_edge(boost::vertex(10, g1), boost::vertex(8, g1), g1); |
|---|
| 97 | boost::add_edge(boost::vertex(10, g2), boost::vertex(8, g2), g2); |
|---|
| 98 | boost::add_edge(boost::vertex(11, g1), boost::vertex(19, g1), g1); |
|---|
| 99 | boost::add_edge(boost::vertex(11, g2), boost::vertex(19, g2), g2); |
|---|
| 100 | boost::add_edge(boost::vertex(11, g1), boost::vertex(15, g1), g1); |
|---|
| 101 | boost::add_edge(boost::vertex(11, g2), boost::vertex(15, g2), g2); |
|---|
| 102 | boost::add_edge(boost::vertex(11, g1), boost::vertex(4, g1), g1); |
|---|
| 103 | boost::add_edge(boost::vertex(11, g2), boost::vertex(4, g2), g2); |
|---|
| 104 | boost::add_edge(boost::vertex(12, g1), boost::vertex(19, g1), g1); |
|---|
| 105 | boost::add_edge(boost::vertex(12, g2), boost::vertex(19, g2), g2); |
|---|
| 106 | boost::add_edge(boost::vertex(12, g1), boost::vertex(8, g1), g1); |
|---|
| 107 | boost::add_edge(boost::vertex(12, g2), boost::vertex(8, g2), g2); |
|---|
| 108 | boost::add_edge(boost::vertex(12, g1), boost::vertex(4, g1), g1); |
|---|
| 109 | boost::add_edge(boost::vertex(12, g2), boost::vertex(4, g2), g2); |
|---|
| 110 | boost::add_edge(boost::vertex(13, g1), boost::vertex(15, g1), g1); |
|---|
| 111 | boost::add_edge(boost::vertex(13, g2), boost::vertex(15, g2), g2); |
|---|
| 112 | boost::add_edge(boost::vertex(13, g1), boost::vertex(8, g1), g1); |
|---|
| 113 | boost::add_edge(boost::vertex(13, g2), boost::vertex(8, g2), g2); |
|---|
| 114 | boost::add_edge(boost::vertex(13, g1), boost::vertex(4, g1), g1); |
|---|
| 115 | boost::add_edge(boost::vertex(13, g2), boost::vertex(4, g2), g2); |
|---|
| 116 | boost::add_edge(boost::vertex(14, g1), boost::vertex(22, g1), g1); |
|---|
| 117 | boost::add_edge(boost::vertex(14, g2), boost::vertex(22, g2), g2); |
|---|
| 118 | boost::add_edge(boost::vertex(14, g1), boost::vertex(12, g1), g1); |
|---|
| 119 | boost::add_edge(boost::vertex(14, g2), boost::vertex(12, g2), g2); |
|---|
| 120 | boost::add_edge(boost::vertex(15, g1), boost::vertex(22, g1), g1); |
|---|
| 121 | boost::add_edge(boost::vertex(15, g2), boost::vertex(22, g2), g2); |
|---|
| 122 | boost::add_edge(boost::vertex(15, g1), boost::vertex(6, g1), g1); |
|---|
| 123 | boost::add_edge(boost::vertex(15, g2), boost::vertex(6, g2), g2); |
|---|
| 124 | boost::add_edge(boost::vertex(16, g1), boost::vertex(12, g1), g1); |
|---|
| 125 | boost::add_edge(boost::vertex(16, g2), boost::vertex(12, g2), g2); |
|---|
| 126 | boost::add_edge(boost::vertex(16, g1), boost::vertex(6, g1), g1); |
|---|
| 127 | boost::add_edge(boost::vertex(16, g2), boost::vertex(6, g2), g2); |
|---|
| 128 | boost::add_edge(boost::vertex(17, g1), boost::vertex(20, g1), g1); |
|---|
| 129 | boost::add_edge(boost::vertex(17, g2), boost::vertex(20, g2), g2); |
|---|
| 130 | boost::add_edge(boost::vertex(18, g1), boost::vertex(9, g1), g1); |
|---|
| 131 | boost::add_edge(boost::vertex(18, g2), boost::vertex(9, g2), g2); |
|---|
| 132 | boost::add_edge(boost::vertex(19, g1), boost::vertex(23, g1), g1); |
|---|
| 133 | boost::add_edge(boost::vertex(19, g2), boost::vertex(23, g2), g2); |
|---|
| 134 | boost::add_edge(boost::vertex(19, g1), boost::vertex(18, g1), g1); |
|---|
| 135 | boost::add_edge(boost::vertex(19, g2), boost::vertex(18, g2), g2); |
|---|
| 136 | boost::add_edge(boost::vertex(20, g1), boost::vertex(23, g1), g1); |
|---|
| 137 | boost::add_edge(boost::vertex(20, g2), boost::vertex(23, g2), g2); |
|---|
| 138 | boost::add_edge(boost::vertex(20, g1), boost::vertex(13, g1), g1); |
|---|
| 139 | boost::add_edge(boost::vertex(20, g2), boost::vertex(13, g2), g2); |
|---|
| 140 | boost::add_edge(boost::vertex(21, g1), boost::vertex(18, g1), g1); |
|---|
| 141 | boost::add_edge(boost::vertex(21, g2), boost::vertex(18, g2), g2); |
|---|
| 142 | boost::add_edge(boost::vertex(21, g1), boost::vertex(13, g1), g1); |
|---|
| 143 | boost::add_edge(boost::vertex(21, g2), boost::vertex(13, g2), g2); |
|---|
| 144 | boost::add_edge(boost::vertex(22, g1), boost::vertex(21, g1), g1); |
|---|
| 145 | boost::add_edge(boost::vertex(22, g2), boost::vertex(21, g2), g2); |
|---|
| 146 | boost::add_edge(boost::vertex(23, g1), boost::vertex(16, g1), g1); |
|---|
| 147 | boost::add_edge(boost::vertex(23, g2), boost::vertex(16, g2), g2); |
|---|
| 148 | |
|---|
| 149 | IndexMap1 index_map1 = boost::get(boost::vertex_index_t(), g1); |
|---|
| 150 | IndexMap2 index_map2 = boost::get(boost::vertex_index_t(), g2); |
|---|
| 151 | boost::graph_traits<Graph1>::vertex_iterator vi1, vend1; |
|---|
| 152 | boost::graph_traits<Graph2>::vertex_iterator vi2, vend2; |
|---|
| 153 | |
|---|
| 154 | boost::graph_traits<Graph1>::adjacency_iterator ai1, aend1; |
|---|
| 155 | boost::graph_traits<Graph2>::adjacency_iterator ai2, aend2; |
|---|
| 156 | |
|---|
| 157 | for (boost::tie(vi1, vend1) = boost::vertices(g1), boost::tie(vi2, vend2) =boost::vertices(g2); vi1 != vend1; ++vi1, ++vi2) |
|---|
| 158 | { |
|---|
| 159 | BOOST_CHECK(boost::get(index_map1, *vi1) == boost::get(index_map2, *vi2)); |
|---|
| 160 | |
|---|
| 161 | for (boost::tie(ai1, aend1) = boost::adjacent_vertices(*vi1, g1), |
|---|
| 162 | boost::tie(ai2, aend2) = boost::adjacent_vertices(*vi2, g2); |
|---|
| 163 | ai1 != aend1; |
|---|
| 164 | ++ai1, ++ai2) |
|---|
| 165 | { |
|---|
| 166 | BOOST_CHECK(boost::get(index_map1, *ai1) == boost::get(index_map2, *ai2)); |
|---|
| 167 | } |
|---|
| 168 | } |
|---|
| 169 | |
|---|
| 170 | boost::graph_traits<Graph1>::out_edge_iterator ei1, eend1; |
|---|
| 171 | boost::graph_traits<Graph2>::out_edge_iterator ei2, eend2; |
|---|
| 172 | |
|---|
| 173 | for (boost::tie(vi1, vend1) = boost::vertices(g1), |
|---|
| 174 | boost::tie(vi2, vend2) = boost::vertices(g2); vi1 != vend1; ++vi1, ++vi2) |
|---|
| 175 | { |
|---|
| 176 | BOOST_CHECK(boost::get(index_map1, *vi1) == boost::get(index_map2, *vi2)); |
|---|
| 177 | |
|---|
| 178 | for (boost::tie(ei1, eend1) = boost::out_edges(*vi1, g1), |
|---|
| 179 | boost::tie(ei2, eend2) = boost::out_edges(*vi2, g2); |
|---|
| 180 | ei1 != eend1; |
|---|
| 181 | ++ei1, ++ei2) |
|---|
| 182 | { |
|---|
| 183 | BOOST_CHECK(boost::get(index_map1, boost::target(*ei1, g1)) == boost::get(index_map2, boost::target(*ei2, g2))); |
|---|
| 184 | } |
|---|
| 185 | } |
|---|
| 186 | |
|---|
| 187 | return 0; |
|---|
| 188 | } |
|---|
| 189 | |
|---|
