1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
// Boost Graph library
// Copyright Douglas Gregor 2004. Use, modification and
// distribution is subject to the Boost Software License, Version
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/test/minimal.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <string>
#include <vector>
using namespace std;
using namespace boost;
struct City
{
City() {}
City(const std::string& name, int pop, int zipcode) : name(name), population(pop)
{
zipcodes.push_back(zipcode);
}
string name;
int population;
vector<int> zipcodes;
};
struct Highway
{
Highway() {}
Highway(const string& name, double miles, int speed_limit = 65, int lanes = 4, bool divided = true)
: name(name), miles(miles), speed_limit(speed_limit), lanes(lanes), divided(divided) {}
string name;
double miles;
int speed_limit;
int lanes;
bool divided;
};
template<bool> struct truth {};
template<typename Map, typename VertexIterator, typename Bundle>
typename boost::graph_traits<Map>::vertex_descriptor
do_add_vertex(Map& map, VertexIterator, const Bundle& bundle, truth<true>)
{
return add_vertex(bundle, map);
}
template<typename Map, typename VertexIterator, typename Bundle>
typename boost::graph_traits<Map>::vertex_descriptor
do_add_vertex(Map& map, VertexIterator& vi, const Bundle& bundle, truth<false>)
{
get(boost::vertex_bundle, map)[*vi] = bundle;
return *vi++;
}
template<typename Map, bool CanAddVertex>
void test_bundled_properties(Map*, truth<CanAddVertex> can_add_vertex)
{
typedef typename boost::graph_traits<Map>::vertex_iterator vertex_iterator;
typedef typename boost::graph_traits<Map>::vertex_descriptor vertex_descriptor;
typedef typename boost::graph_traits<Map>::edge_descriptor edge_descriptor;
Map map(3);
vertex_iterator vi = vertices(map).first;
vertex_descriptor v = *vi;
map[v].name = "Troy";
map[v].population = 49170;
map[v].zipcodes.push_back(12180);
++vi;
vertex_descriptor u = *vi++;
map[u].name = "Albany";
map[u].population = 95658;
map[u].zipcodes.push_back(12201);
// Try adding a vertex with a property value
vertex_descriptor bloomington = do_add_vertex(map, vi, City("Bloomington", 39000, 47401),
can_add_vertex);
BOOST_TEST(get(boost::vertex_bundle, map)[bloomington].zipcodes[0] == 47401);
edge_descriptor e = add_edge(v, u, map).first;
map[e].name = "I-87";
map[e].miles = 10;
map[e].speed_limit = 65;
map[e].lanes = 4;
map[e].divided = true;
edge_descriptor our_trip = add_edge(v, bloomington, Highway("Long haul", 1000), map).first;
BOOST_TEST(get(boost::edge_bundle, map, our_trip).miles == 1000);
BOOST_TEST(get(get(&City::name, map), v) == "Troy");
BOOST_TEST(get(get(&Highway::name, map), e) == "I-87");
BOOST_TEST(get(&City::name, map, u) == "Albany");
BOOST_TEST(get(&Highway::name, map, e) == "I-87");
put(&City::population, map, v, 49168);
BOOST_TEST(get(&City::population, map)[v] == 49168);
boost::filtered_graph<Map, boost::keep_all> fmap(map, boost::keep_all());
BOOST_TEST(get(boost::edge_bundle, map, our_trip).miles == 1000);
BOOST_TEST(get(get(&City::name, fmap), v) == "Troy");
BOOST_TEST(get(get(&Highway::name, fmap), e) == "I-87");
BOOST_TEST(get(&City::name, fmap, u) == "Albany");
BOOST_TEST(get(&Highway::name, fmap, e) == "I-87");
put(&City::population, fmap, v, 49169);
BOOST_TEST(get(&City::population, fmap)[v] == 49169);
}
int test_main(int, char*[])
{
typedef boost::adjacency_list<
boost::listS, boost::vecS, boost::bidirectionalS,
City, Highway> Map1;
typedef boost::adjacency_matrix<boost::directedS,
City, Highway> Map2;
test_bundled_properties(static_cast<Map1*>(0), truth<true>());
test_bundled_properties(static_cast<Map2*>(0), truth<false>());
return 0;
}
|
