Classes
struct	brandes_betweenness_centrality_dispatch1

struct	brandes_betweenness_centrality_dispatch1< param_not_found >

struct	brandes_dijkstra_shortest_paths
	Function object that calls Dijkstra's shortest paths algorithm using the Dijkstra visitor for the Brandes betweenness centrality algorithm. More...

struct	brandes_dijkstra_visitor
	Customized visitor passed to Dijkstra's algorithm by Brandes' betweenness centrality algorithm. More...

struct	brandes_unweighted_shortest_paths
	Function object that invokes breadth-first search for the unweighted form of the Brandes betweenness centrality algorithm. More...

struct	edge_or_side
	Denotes an edge or display area side length used to scale a Kamada-Kawai drawing. More...

class	edge_t

struct	is_bgl_named_params

struct	is_bgl_named_params< bgl_named_params< Param, Tag, Rest > >

struct	kamada_kawai_spring_layout_impl
	Implementation of the Kamada-Kawai spring layout algorithm. More...

struct	linear_solver
	Dense linear solver for fixed-size matrices. More...

struct	linear_solver< 1 >

struct	linear_solver< 2 >

struct	linear_solver< 3 >

class	mutate_graph

class	mutate_graph_impl

class	mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >

struct	non_distributed_brandes_betweenness_centrality_dispatch1

struct	non_distributed_brandes_betweenness_centrality_dispatch1< param_not_found >

Typedefs
typedef std::string	id_t

typedef id_t	node_t

Functions
template<typename Iter >
void	init_centrality_map (std::pair< Iter, Iter >, dummy_property_map)

template<typename Iter , typename Centrality >
void	init_centrality_map (std::pair< Iter, Iter > keys, Centrality centrality_map)

template<typename Key , typename T >
void	update_centrality (dummy_property_map, const Key &, const T &)

template<typename CentralityMap , typename Key , typename T >
void	update_centrality (CentralityMap centrality_map, Key k, const T &x)

template<typename Iter >
void	divide_centrality_by_two (std::pair< Iter, Iter >, dummy_property_map)

template<typename Iter , typename CentralityMap >
void	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	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 WeightMap , typename VertexIndexMap >
void	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	brandes_betweenness_centrality_dispatch2 (const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, VertexIndexMap vertex_index)

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename WeightMap , typename VertexIndexMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality_dispatch2 (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, WeightMap weight_map, VertexIndexMap vertex_index, Buffer sources)

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename VertexIndexMap , typename Buffer >
void	non_distributed_brandes_betweenness_centrality_dispatch2 (const ProcessGroup &pg, const Graph &g, CentralityMap centrality, EdgeCentralityMap edge_centrality_map, VertexIndexMap vertex_index, Buffer sources)

template<typename Graph , typename DistanceMap , typename IndexMap , typename T >
T	compute_edge_length (const Graph &, DistanceMap, IndexMap, edge_or_side< true, T > length)
	Compute the edge length from an edge length. More...

template<typename Graph , typename DistanceMap , typename IndexMap , typename T >
T	compute_edge_length (const Graph &g, DistanceMap distance, IndexMap index, edge_or_side< false, T > length)
	Compute the edge length based on the display area side length. More...

Typedef Documentation

typedef std::string boost::detail::graph::id_t

typedef id_t boost::detail::graph::node_t

Function Documentation

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
	)

References boost::brandes_betweenness_centrality(), boost::detail::degree_size_type, boost::distance(), boost::make_iterator_property_map(), boost::num_vertices(), boost::program_options::value(), and boost::vertex_index.

Referenced by boost::brandes_betweenness_centrality(), boost::detail::graph::brandes_betweenness_centrality_dispatch1< WeightMap >::run(), and boost::detail::graph::brandes_betweenness_centrality_dispatch1< param_not_found >::run().

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
	)

References boost::brandes_betweenness_centrality(), boost::detail::degree_size_type, boost::distance(), boost::make_iterator_property_map(), boost::num_vertices(), boost::program_options::value(), and boost::vertex_index.

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
	)

References boost::asio::begin, divide_centrality_by_two(), boost::edges(), init_centrality_map(), boost::is_undirected(), boost::put(), boost::asio::s, boost::source(), update_centrality(), boost::program_options::value(), boost::detail::vertex_iterator, and boost::vertices().

Referenced by boost::brandes_betweenness_centrality().

template<typename Graph , typename DistanceMap , typename IndexMap , typename T >

T boost::detail::graph::compute_edge_length	(	const Graph &	,
		DistanceMap	,
		IndexMap	,
		edge_or_side< true, T >	length
	)

Compute the edge length from an edge length.

This is trivial.

References boost::detail::graph::edge_or_side< Edge, T >::value.

Referenced by boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::run().

template<typename Graph , typename DistanceMap , typename IndexMap , typename T >

T boost::detail::graph::compute_edge_length	(	const Graph &	g,
		DistanceMap	distance,
		IndexMap	index,
		edge_or_side< false, T >	length
	)

Compute the edge length based on the display area side length.

We do this by dividing the side length by the largest shortest distance between any two vertices in the graph.

References boost::end, boost::xpressive::first, boost::locale::period::marks::second, T, boost::detail::graph::edge_or_side< Edge, T >::value, boost::detail::vertex_iterator, and boost::vertices().

template<typename Iter >

void boost::detail::graph::divide_centrality_by_two	(	std::pair< Iter, Iter >	,
		dummy_property_map
	)

inline

Referenced by brandes_betweenness_centrality_impl(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

template<typename Iter , typename CentralityMap >

void boost::detail::graph::divide_centrality_by_two	(	std::pair< Iter, Iter >	keys,
		CentralityMap	centrality_map
	)

inline

References boost::put().

Referenced by boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

template<typename Iter >

void boost::detail::graph::init_centrality_map	(	std::pair< Iter, Iter >	,
		dummy_property_map
	)

inline

Referenced by brandes_betweenness_centrality_impl(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

template<typename Iter , typename Centrality >

void boost::detail::graph::init_centrality_map	(	std::pair< Iter, Iter >	keys,
		Centrality	centrality_map
	)

References boost::put().

Referenced by boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), and boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename WeightMap , typename VertexIndexMap , typename Buffer >

void boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		WeightMap	weight_map,
		VertexIndexMap	vertex_index,
		Buffer	sources
	)

References boost::detail::degree_size_type, boost::distance(), boost::make_iterator_property_map(), boost::non_distributed_brandes_betweenness_centrality(), boost::graph::num_vertices(), boost::unwrap_ref(), boost::program_options::value(), and boost::vertex_index.

Referenced by boost::non_distributed_brandes_betweenness_centrality().

template<typename ProcessGroup , typename Graph , typename CentralityMap , typename EdgeCentralityMap , typename VertexIndexMap , typename Buffer >

void boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2	(	const ProcessGroup &	pg,
		const Graph &	g,
		CentralityMap	centrality,
		EdgeCentralityMap	edge_centrality_map,
		VertexIndexMap	vertex_index,
		Buffer	sources
	)

References boost::detail::degree_size_type, boost::distance(), boost::make_iterator_property_map(), boost::non_distributed_brandes_betweenness_centrality(), boost::graph::num_vertices(), boost::unwrap_ref(), boost::program_options::value(), and boost::vertex_index.

Referenced by boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch1< WeightMap >::run(), and boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch1< param_not_found >::run().

template<typename Key , typename T >

void boost::detail::graph::update_centrality	(	dummy_property_map	,
		const Key &	,
		const T &
	)

inline

Referenced by brandes_betweenness_centrality_impl(), boost::graph::parallel::detail::do_brandes_sssp(), and boost::graph::parallel::detail::do_sequential_brandes_sssp().

template<typename CentralityMap , typename Key , typename T >

void boost::detail::graph::update_centrality	(	CentralityMap	centrality_map,
		Key	k,
		const T &	x
	)

inline

References boost::put().

Referenced by boost::graph::parallel::detail::do_brandes_sssp(), and boost::graph::parallel::detail::do_sequential_brandes_sssp().

Classes

Typedefs

Functions

Typedef Documentation

Function Documentation