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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
//
//=======================================================================
// Copyright 2002 Marc Wintermantel (wintermantel@imes.mavt.ethz.ch)
// ETH Zurich, Center of Structure Technologies (www.imes.ethz.ch/st)
//
// This file is part of the Boost Graph Library
//
// You should have received a copy of the License Agreement for the
// Boost Graph Library along with the software; see the file LICENSE.
// If not, contact Office of Research, University of Notre Dame, Notre
// Dame, IN 46556.
//
// Permission to modify the code and to distribute modified code is
// granted, provided the text of this NOTICE is retained, a notice that
// the code was modified is included with the above COPYRIGHT NOTICE and
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
// file is distributed with the modified code.
//
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
// By way of example, but not limitation, Licensor MAKES NO
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
// OR OTHER RIGHTS.
//=======================================================================
//
#include <boost/config.hpp>
#include <vector>
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/sloan_ordering.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/bandwidth.hpp>
#include <boost/graph/profile.hpp>
#include <boost/graph/wavefront.hpp>
using std::cout;
using std::endl;
/*
Sample Output
#####################################
### First light of sloan-ordering ###
#####################################
original bandwidth: 8
original profile: 42
original max_wavefront: 7
original aver_wavefront: 4.2
original rms_wavefront: 4.58258
Starting vertex: 0
Pseudoperipheral vertex: 9
Pseudoperipheral radius: 4
Sloan ordering starting at: 0
0 8 3 7 5 2 4 6 1 9
bandwidth: 4
profile: 28
max_wavefront: 4
aver_wavefront: 2.8
rms_wavefront: 2.93258
Sloan ordering without a start-vertex:
8 0 3 7 5 2 4 6 1 9
bandwidth: 4
profile: 27
max_wavefront: 4
aver_wavefront: 2.7
rms_wavefront: 2.84605
###############################
### sloan-ordering finished ###
###############################
*/
int main(int , char* [])
{
cout << endl;
cout << "#####################################" << endl;
cout << "### First light of sloan-ordering ###" << endl;
cout << "#####################################" << endl << endl;
using namespace boost;
using namespace std;
//Defining the graph type
typedef adjacency_list<
setS,
vecS,
undirectedS,
property<
vertex_color_t,
default_color_type,
property<
vertex_degree_t,
int,
property<
vertex_priority_t,
double > > > > Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::vertices_size_type size_type;
typedef std::pair<std::size_t, std::size_t> Pair;
Pair edges[14] = { Pair(0,3), //a-d
Pair(0,5), //a-f
Pair(1,2), //b-c
Pair(1,4), //b-e
Pair(1,6), //b-g
Pair(1,9), //b-j
Pair(2,3), //c-d
Pair(2,4), //c-e
Pair(3,5), //d-f
Pair(3,8), //d-i
Pair(4,6), //e-g
Pair(5,6), //f-g
Pair(5,7), //f-h
Pair(6,7) }; //g-h
//Creating a graph and adding the edges from above into it
Graph G(10);
for (int i = 0; i < 14; ++i)
add_edge(edges[i].first, edges[i].second, G);
//Creating two iterators over the vertices
graph_traits<Graph>::vertex_iterator ui, ui_end;
//Creating a property_map with the degrees of the degrees of each vertex
property_map<Graph,vertex_degree_t>::type deg = get(vertex_degree, G);
for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui)
deg[*ui] = degree(*ui, G);
//Creating a property_map for the indices of a vertex
property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, G);
std::cout << "original bandwidth: " << bandwidth(G) << std::endl;
std::cout << "original profile: " << profile(G) << std::endl;
std::cout << "original max_wavefront: " << max_wavefront(G) << std::endl;
std::cout << "original aver_wavefront: " << aver_wavefront(G) << std::endl;
std::cout << "original rms_wavefront: " << rms_wavefront(G) << std::endl;
//Creating a vector of vertices
std::vector<Vertex> sloan_order(num_vertices(G));
//Creating a vector of size_type
std::vector<size_type> perm(num_vertices(G));
{
//Setting the start node
Vertex s = vertex(0, G);
int ecc; //defining a variable for the pseudoperipheral radius
//Calculating the pseudoeperipheral node and radius
Vertex e = pseudo_peripheral_pair(G, s, ecc, get(vertex_color, G), get(vertex_degree, G) );
cout << endl;
cout << "Starting vertex: " << s << endl;
cout << "Pseudoperipheral vertex: " << e << endl;
cout << "Pseudoperipheral radius: " << ecc << endl << endl;
//Sloan ordering
sloan_ordering(G, s, e, sloan_order.begin(), get(vertex_color, G),
get(vertex_degree, G), get(vertex_priority, G));
cout << "Sloan ordering starting at: " << s << endl;
cout << " ";
for (std::vector<Vertex>::const_iterator i = sloan_order.begin();
i != sloan_order.end(); ++i)
cout << index_map[*i] << " ";
cout << endl;
for (size_type c = 0; c != sloan_order.size(); ++c)
perm[index_map[sloan_order[c]]] = c;
std::cout << " bandwidth: "
<< bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " profile: "
<< profile(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " max_wavefront: "
<< max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " aver_wavefront: "
<< aver_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " rms_wavefront: "
<< rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
}
/////////////////////////////////////////////////
//Version including finding a good starting point
/////////////////////////////////////////////////
{
//sloan_ordering
sloan_ordering(G, sloan_order.begin(),
get(vertex_color, G),
make_degree_map(G),
get(vertex_priority, G) );
cout << endl << "Sloan ordering without a start-vertex:" << endl;
cout << " ";
for (std::vector<Vertex>::const_iterator i=sloan_order.begin();
i != sloan_order.end(); ++i)
cout << index_map[*i] << " ";
cout << endl;
for (size_type c = 0; c != sloan_order.size(); ++c)
perm[index_map[sloan_order[c]]] = c;
std::cout << " bandwidth: "
<< bandwidth(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " profile: "
<< profile(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " max_wavefront: "
<< max_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " aver_wavefront: "
<< aver_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
std::cout << " rms_wavefront: "
<< rms_wavefront(G, make_iterator_property_map(&perm[0], index_map, perm[0]))
<< std::endl;
}
cout << endl;
cout << "###############################" << endl;
cout << "### sloan-ordering finished ###" << endl;
cout << "###############################" << endl << endl;
return 0;
}
|
