betweenness_centrality.hpp File Reference

#include <stack>
#include <vector>
#include <boost/graph/overloading.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/relax.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/type_traits/is_convertible.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/mpl/if.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/named_function_params.hpp>
#include <algorithm>

Include dependency graph for betweenness_centrality.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::detail::graph::brandes_dijkstra_visitor< Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap >
	Customized visitor passed to Dijkstra's algorithm by Brandes' betweenness centrality algorithm. More...
struct	boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >
	Function object that calls Dijkstra's shortest paths algorithm using the Dijkstra visitor for the Brandes betweenness centrality algorithm. More...
struct	boost::detail::graph::brandes_unweighted_shortest_paths
	Function object that invokes breadth-first search for the unweighted form of the Brandes betweenness centrality algorithm. More...
struct	boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type< Graph, IncomingMap, DistanceMap, PathCountMap >
	Customized visitor passed to breadth-first search, which records predecessor and the number of shortest paths to each vertex. More...
struct	boost::detail::graph::brandes_betweenness_centrality_dispatch1< WeightMap >
struct	boost::detail::graph::brandes_betweenness_centrality_dispatch1< param_not_found >
struct	boost::detail::graph::is_bgl_named_params< T >
struct	boost::detail::graph::is_bgl_named_params< bgl_named_params< Param, Tag, Rest > >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail
	boost::detail::graph

Functions
template<typename Iter >
void	boost::detail::graph::init_centrality_map (std::pair< Iter, Iter >, dummy_property_map)
template<typename Iter , typename Centrality >
void	boost::detail::graph::init_centrality_map (std::pair< Iter, Iter > keys, Centrality centrality_map)
template<typename Key , typename T >
void	boost::detail::graph::update_centrality (dummy_property_map, const Key &, const T &)
template<typename CentralityMap , typename Key , typename T >
void	boost::detail::graph::update_centrality (CentralityMap centrality_map, Key k, const T &x)
template<typename Iter >
void	boost::detail::graph::divide_centrality_by_two (std::pair< Iter, Iter >, dummy_property_map)
template<typename Iter , typename CentralityMap >
void	boost::detail::graph::divide_centrality_by_two (std::pair< Iter, Iter > keys, CentralityMap centrality_map)
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename ShortestPaths >
void	boost::detail::graph::brandes_betweenness_centrality_impl (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, ShortestPaths shortest_paths)
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap >
void	boost::brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename IncomingMap , typename DistanceMap , typename DependencyMap , typename PathCountMap , typename VertexIndexMap , typename WeightMap >
void	boost::brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, IncomingMap incoming, DistanceMap distance, DependencyMap dependency, PathCountMap path_count, VertexIndexMap vertex_index, WeightMap weight_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename WeightMap , typename VertexIndexMap >
void	boost::detail::graph::brandes_betweenness_centrality_dispatch2 (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, WeightMap weight_map, VertexIndexMap vertex_index)
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename VertexIndexMap >
void	boost::detail::graph::brandes_betweenness_centrality_dispatch2 (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, VertexIndexMap vertex_index)
template<typename Graph , typename Param , typename Tag , typename Rest >
void	boost::brandes_betweenness_centrality (const Graph &g, const bgl_named_params< Param, Tag, Rest > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap >
disable_if < detail::graph::is_bgl_named_params < CentralityMap >, void > ::type	boost::brandes_betweenness_centrality (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap , typename EdgeCentralityMap >
void	boost::brandes_betweenness_centrality (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename CentralityMap >
void	boost::relative_betweenness_centrality (const Graph &g, CentralityMap centrality)
	Converts "absolute" betweenness centrality (as computed by the brandes_betweenness_centrality algorithm) in the centrality map into "relative" centrality. More...
template<typename Graph , typename CentralityMap >
property_traits< CentralityMap > ::value_type	boost::central_point_dominance (const Graph &g, CentralityMap centrality BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))