123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132 |
- // (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>();
- }
|