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
|
// (C) Copyright 2007-2009 Andrew Sutton
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
#include <iostream>
#include <vector>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/directed_graph.hpp>
#include <boost/graph/floyd_warshall_shortest.hpp>
#include <boost/graph/closeness_centrality.hpp>
#include <boost/graph/exterior_property.hpp>
#include <boost/graph/property_maps/constant_property_map.hpp>
using namespace std;
using namespace boost;
// number of vertices in the graph
static const unsigned N = 5;
template < typename Graph > struct vertex_vector
{
typedef graph_traits< Graph > traits;
typedef vector< typename traits::vertex_descriptor > type;
};
template < typename Graph >
void build_graph(Graph& g, typename vertex_vector< Graph >::type& v)
{
// add vertices
for (size_t i = 0; i < N; ++i)
{
v[i] = add_vertex(g);
}
// add edges
add_edge(v[0], v[1], g);
add_edge(v[1], v[2], g);
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
}
template < typename Graph > void test_undirected()
{
typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
typedef typename graph_traits< Graph >::edge_descriptor Edge;
typedef exterior_vertex_property< Graph, double > CentralityProperty;
typedef typename CentralityProperty::container_type CentralityContainer;
typedef typename CentralityProperty::map_type CentralityMap;
typedef exterior_vertex_property< Graph, int > DistanceProperty;
typedef typename DistanceProperty::matrix_type DistanceMatrix;
typedef typename DistanceProperty::matrix_map_type DistanceMatrixMap;
typedef constant_property_map< Edge, int > WeightMap;
Graph g;
vector< Vertex > v(N);
build_graph(g, v);
CentralityContainer centralities(num_vertices(g));
DistanceMatrix distances(num_vertices(g));
CentralityMap cm(centralities, g);
DistanceMatrixMap dm(distances, g);
WeightMap wm(1);
floyd_warshall_all_pairs_shortest_paths(g, dm, weight_map(wm));
all_closeness_centralities(g, dm, cm);
BOOST_ASSERT(cm[v[0]] == double(1) / 5);
BOOST_ASSERT(cm[v[1]] == double(1) / 7);
BOOST_ASSERT(cm[v[2]] == double(1) / 7);
BOOST_ASSERT(cm[v[3]] == double(1) / 9);
BOOST_ASSERT(cm[v[4]] == double(1) / 6);
}
template < typename Graph > void test_directed()
{
typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
typedef typename graph_traits< Graph >::edge_descriptor Edge;
typedef exterior_vertex_property< Graph, double > CentralityProperty;
typedef typename CentralityProperty::container_type CentralityContainer;
typedef typename CentralityProperty::map_type CentralityMap;
typedef exterior_vertex_property< Graph, int > DistanceProperty;
typedef typename DistanceProperty::matrix_type DistanceMatrix;
typedef typename DistanceProperty::matrix_map_type DistanceMatrixMap;
typedef constant_property_map< Edge, int > WeightMap;
Graph g;
vector< Vertex > v(N);
build_graph(g, v);
CentralityContainer centralities(num_vertices(g));
DistanceMatrix distances(num_vertices(g));
CentralityMap cm(centralities, g);
DistanceMatrixMap dm(distances, g);
WeightMap wm(1);
floyd_warshall_all_pairs_shortest_paths(g, dm, weight_map(wm));
all_closeness_centralities(g, dm, cm);
BOOST_ASSERT(cm[v[0]] == double(0));
BOOST_ASSERT(cm[v[1]] == double(0));
BOOST_ASSERT(cm[v[2]] == double(0));
BOOST_ASSERT(cm[v[3]] == double(1) / 10);
BOOST_ASSERT(cm[v[4]] == double(0));
}
int main(int, char*[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
test_undirected< Graph >();
test_directed< Digraph >();
}
|
