quick-tour.cpp
3.39 KB
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
//=======================================================================
// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under 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/config.hpp>
#include <iostream>
#include <fstream>
#include <boost/graph/adjacency_list.hpp>
using namespace boost;
template < typename VertexDescriptor, typename VertexNameMap >
void print_vertex_name(VertexDescriptor v, VertexNameMap name_map)
{
std::cout << get(name_map, v);
}
template < typename Graph, typename TransDelayMap, typename VertexNameMap >
void print_trans_delay(typename graph_traits< Graph >::edge_descriptor e,
const Graph& g, TransDelayMap delay_map, VertexNameMap name_map)
{
std::cout << "trans-delay(" << get(name_map, source(e, g)) << ","
<< get(name_map, target(e, g)) << ") = " << get(delay_map, e);
}
template < typename Graph, typename VertexNameMap >
void print_vertex_names(const Graph& g, VertexNameMap name_map)
{
std::cout << "vertices(g) = { ";
typedef typename graph_traits< Graph >::vertex_iterator iter_t;
for (std::pair< iter_t, iter_t > p = vertices(g); p.first != p.second;
++p.first)
{
print_vertex_name(*p.first, name_map);
std::cout << ' ';
}
std::cout << "}" << std::endl;
}
template < typename Graph, typename TransDelayMap, typename VertexNameMap >
void print_trans_delays(
const Graph& g, TransDelayMap trans_delay_map, VertexNameMap name_map)
{
typename graph_traits< Graph >::edge_iterator first, last;
for (boost::tie(first, last) = edges(g); first != last; ++first)
{
print_trans_delay(*first, g, trans_delay_map, name_map);
std::cout << std::endl;
}
}
template < typename Graph, typename VertexNameMap, typename TransDelayMap >
void build_router_network(
Graph& g, VertexNameMap name_map, TransDelayMap delay_map)
{
typename graph_traits< Graph >::vertex_descriptor a, b, c, d, e;
a = add_vertex(g);
name_map[a] = 'a';
b = add_vertex(g);
name_map[b] = 'b';
c = add_vertex(g);
name_map[c] = 'c';
d = add_vertex(g);
name_map[d] = 'd';
e = add_vertex(g);
name_map[e] = 'e';
typename graph_traits< Graph >::edge_descriptor ed;
bool inserted;
boost::tie(ed, inserted) = add_edge(a, b, g);
delay_map[ed] = 1.2;
boost::tie(ed, inserted) = add_edge(a, d, g);
delay_map[ed] = 4.5;
boost::tie(ed, inserted) = add_edge(b, d, g);
delay_map[ed] = 1.8;
boost::tie(ed, inserted) = add_edge(c, a, g);
delay_map[ed] = 2.6;
boost::tie(ed, inserted) = add_edge(c, e, g);
delay_map[ed] = 5.2;
boost::tie(ed, inserted) = add_edge(d, c, g);
delay_map[ed] = 0.4;
boost::tie(ed, inserted) = add_edge(d, e, g);
delay_map[ed] = 3.3;
}
int main()
{
typedef adjacency_list< listS, listS, directedS,
property< vertex_name_t, char >, property< edge_weight_t, double > >
graph_t;
graph_t g;
property_map< graph_t, vertex_name_t >::type name_map = get(vertex_name, g);
property_map< graph_t, edge_weight_t >::type delay_map
= get(edge_weight, g);
build_router_network(g, name_map, delay_map);
print_vertex_names(g, name_map);
print_trans_delays(g, delay_map, name_map);
}