boost::graph Namespace Reference

Namespaces
	accounting
	detail
	distributed
	keywords
	parallel

Classes
struct	add_removed_edge_capacity
struct	add_removed_edge_property
struct	bfs_visitor_event_not_overridden
struct	cannot_add_vertex
	Throw an exception whenever one tries to construct a VertexProperty instance from its name. More...
class	dimacs_basic_reader
class	dimacs_edge_iterator
class	dimacs_edge_weight_iterator
class	dimacs_exception
class	distribution_global_index_map
struct	equal_edge
struct	internal_vertex_constructor
	Trait used to construct an instance of a VertexProperty, which is a class type that stores the properties associated with a vertex in a graph, from just the name of that vertex property. More...
struct	internal_vertex_constructor< property< Tag, T, Base > >
	Extract the internal vertex constructor from a property structure by looking at its base. More...
struct	internal_vertex_name
	Trait used to extract the internal vertex name from a vertex property. More...
struct	internal_vertex_name< property< Tag, T, Base > >
	Extract the internal vertex name from a property structure by looking at its base. More...
struct	maybe_named_graph
	A graph mixin that can provide a mapping from names to vertices, and use that mapping to simplify creation and manipulation of graphs. More...
struct	maybe_named_graph< Graph, Vertex, VertexProperty, void >
	A graph mixin that can provide a mapping from names to vertices, and use that mapping to simplify creation and manipulation of graphs. More...
class	metis_distribution
class	metis_exception
class	metis_input_exception
class	metis_reader
struct	n_iterations
class	named_graph
	named_graph is a mixin that provides names for the vertices of a graph, including a mapping from names to vertices. More...
struct	point_traits
struct	sort_edge_by_origin
class	stored_global_index_map
class	vertex_and_edge_range
struct	vertex_from_name
	Construct an instance of VertexProperty directly from its name. More...
class	vertex_list_adaptor

Functions
template<class Property , class Graph >
void	property_on_inedges (Property p, const Graph &g)
template<class Property , class Graph >
void	property_on_outedges (Property p, const Graph &g)
template<class Property , class Graph >
void	property_on_successors (Property p, const Graph &g)
template<class Property , class Graph >
void	property_on_predecessors (Property p, const Graph &g)
template<class Property , class Graph >
void	property_on_adjacents (Property p, const Graph &g)
template<class PropertyIn , class PropertyOut , class Graph >
void	copy_vertex_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<class PropertyIn , class PropertyOut , class Graph >
void	copy_edge_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<typename Distribution , typename OwnerPropertyMap , typename LocalPropertyMap >
distribution_global_index_map < Distribution, OwnerPropertyMap, LocalPropertyMap >::value_type	get (const distribution_global_index_map< Distribution, OwnerPropertyMap, LocalPropertyMap > &p, typename distribution_global_index_map< Distribution, OwnerPropertyMap, LocalPropertyMap >::key_type x)
template<typename Graph , typename Distribution >
distribution_global_index_map < Distribution, typename property_map< Graph, vertex_owner_t >::const_type, typename property_map< Graph, vertex_local_t >::const_type >	make_distribution_global_index_map (const Graph &g, const Distribution &d)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap >	make_vertex_list_adaptor (const Graph &g, const GlobalIndexMap &index_map)
template<typename Graph >
vertex_list_adaptor< Graph, typename detail::default_global_index_map < Graph >::type >	make_vertex_list_adaptor (const Graph &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::vertex_descriptor	source (typename vertex_list_adaptor< Graph, GlobalIndexMap >::edge_descriptor e, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::vertex_descriptor	target (typename vertex_list_adaptor< Graph, GlobalIndexMap >::edge_descriptor e, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::out_edge_iterator, typename vertex_list_adaptor< Graph, GlobalIndexMap > ::out_edge_iterator >	out_edges (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::degree_size_type	out_degree (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::in_edge_iterator, typename vertex_list_adaptor< Graph, GlobalIndexMap > ::in_edge_iterator >	in_edges (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::degree_size_type	in_degree (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::degree_size_type	degree (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::adjacency_iterator, typename vertex_list_adaptor< Graph, GlobalIndexMap > ::adjacency_iterator >	adjacent_vertices (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::vertex_iterator, typename vertex_list_adaptor< Graph, GlobalIndexMap > ::vertex_iterator >	vertices (const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::vertices_size_type	num_vertices (const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::edge_iterator, typename vertex_list_adaptor< Graph, GlobalIndexMap > ::edge_iterator >	edges (const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::edges_size_type	num_edges (const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename PropertyTag , typename Graph , typename GlobalIndexMap >
property_map< Graph, PropertyTag >::type	get (PropertyTag p, vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename PropertyTag , typename Graph , typename GlobalIndexMap >
property_map< Graph, PropertyTag >::const_type	get (PropertyTag p, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename PropertyTag , typename Graph , typename GlobalIndexMap >
property_traits< typename property_map< Graph, PropertyTag >::type > ::value_type	get (PropertyTag p, const vertex_list_adaptor< Graph, GlobalIndexMap > &g, typename property_traits< typename property_map< Graph, PropertyTag >::type >::key_type const &x)
template<typename PropertyTag , typename Graph , typename GlobalIndexMap >
void	put (PropertyTag p, vertex_list_adaptor< Graph, GlobalIndexMap > &g, typename property_traits< typename property_map< Graph, PropertyTag >::type >::key_type const &x, typename property_traits< typename property_map< Graph, PropertyTag >::type >::value_type const &v)
template<typename Graph , typename GlobalIndexMap >
GlobalIndexMap	get (vertex_index_t, const vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph , typename GlobalIndexMap >
vertex_list_adaptor< Graph, GlobalIndexMap > ::vertices_size_type	get (vertex_index_t, const vertex_list_adaptor< Graph, GlobalIndexMap > &g, typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor x)
template<typename Graph , typename GlobalIndexMap >
std::pair< typename vertex_list_adaptor< Graph, GlobalIndexMap > ::edge_descriptor, bool >	edge (typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor u, typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor v, vertex_list_adaptor< Graph, GlobalIndexMap > &g)
template<typename Graph >
unsigned long	num_dup_edges (Graph &g)
template<typename Graph >
std::map< unsigned long, unsigned long >	dup_edge_dist (Graph &g)
template<typename Graph >
std::map< unsigned long, unsigned long >	degree_dist (Graph &g)
template<typename Graph >
std::map< unsigned long, double >	weight_degree_dist (Graph &g)
template<typename Graph >
bool	has_no_vertices (const Graph &g)
template<typename Graph >
bool	has_no_edges (const Graph &g)
template<typename Graph >
bool	has_no_out_edges (const typename boost::graph_traits< Graph >::vertex_descriptor &v, const Graph &g)
bool	operator== (metis_reader::edge_iterator x, metis_reader::edge_iterator y)
bool	operator!= (metis_reader::edge_iterator x, metis_reader::edge_iterator y)
template<typename Graph , typename Vertex , typename VertexProperty >
optional< Vertex >	find_vertex (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &name, const named_graph< Graph, Vertex, VertexProperty > &g)
	Retrieve the vertex associated with the given name. More...
template<typename Graph , typename Vertex , typename VertexProperty >
disable_if< is_same< typename named_graph< Graph, Vertex, VertexProperty > ::vertex_name_type, VertexProperty >, Vertex > ::type	add_vertex (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &name, named_graph< Graph, Vertex, VertexProperty > &g)
	Retrieve the vertex associated with the given name, or add a new vertex with that name if no such vertex is available. More...
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &u_name, typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &v_name, named_graph< Graph, Vertex, VertexProperty > &g)
	Add an edge using vertex names to refer to the vertices. More...
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &u, typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &v_name, named_graph< Graph, Vertex, VertexProperty > &g)
	Add an edge using vertex descriptors or names to refer to the vertices. More...
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &u_name, typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &v, named_graph< Graph, Vertex, VertexProperty > &g)
	Add an edge using vertex descriptors or names to refer to the vertices. More...
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &u, typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &v_name, typename edge_property_type< Graph >::type const &p, named_graph< Graph, Vertex, VertexProperty > &g)
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &u_name, typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &v, typename edge_property_type< Graph >::type const &p, named_graph< Graph, Vertex, VertexProperty > &g)
template<typename Graph , typename Vertex , typename VertexProperty >
std::pair< typename graph_traits< Graph > ::edge_descriptor, bool >	add_edge (typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &u_name, typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &v_name, typename edge_property_type< Graph >::type const &p, named_graph< Graph, Vertex, VertexProperty > &g)
template<typename Graph , typename RankMap , typename Done , typename RankMap2 >
void	page_rank (const Graph &g, RankMap rank_map, Done done, typename property_traits< RankMap >::value_type damping, typename graph_traits< Graph >::vertices_size_type n, RankMap2 rank_map2 BOOST_GRAPH_ENABLE_IF_MODELS_PARM(Graph, vertex_list_graph_tag))
template<typename Graph , typename RankMap , typename Done >
void	page_rank (const Graph &g, RankMap rank_map, Done done, typename property_traits< RankMap >::value_type damping, typename graph_traits< Graph >::vertices_size_type n)
template<typename Graph , typename RankMap , typename Done >
void	page_rank (const Graph &g, RankMap rank_map, Done done, typename property_traits< RankMap >::value_type damping=0.85)
template<typename Graph , typename RankMap >
void	page_rank (const Graph &g, RankMap rank_map)
template<typename MutableGraph >
void	remove_dangling_links (MutableGraph &g BOOST_GRAPH_ENABLE_IF_MODELS_PARM(MutableGraph, vertex_list_graph_tag))
template<typename Graph , typename ColorMap >
bool	st_connected (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, ColorMap color)
template<typename Graph >
bool	st_connected (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t)
template<class UndirectedGraph , class WeightMap , class ParityMap , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue >
boost::property_traits < WeightMap >::value_type	stoer_wagner_min_cut (const UndirectedGraph &g, WeightMap weights, ParityMap parities, VertexAssignmentMap assignments, KeyedUpdatablePriorityQueue &pq)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
std::pair< VertexIterator, VertexIterator >	vertices (const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > ::vertices_size_type	num_vertices (const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
std::pair< EdgeIterator, EdgeIterator >	edges (const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > ::edges_size_type	num_edges (const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > ::vertex_descriptor	source (typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > ::vertex_descriptor	target (typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &g)
template<typename Graph , typename VertexIterator , typename EdgeIterator >
vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >	make_vertex_and_edge_range (const Graph &g, VertexIterator first_v, VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e)

Function Documentation

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	u_name,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	v_name,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

Add an edge using vertex names to refer to the vertices.

References add_vertex().

Referenced by add_edge().

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &	u,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	v_name,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

Add an edge using vertex descriptors or names to refer to the vertices.

References add_edge(), and add_vertex().

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	u_name,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &	v,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

Add an edge using vertex descriptors or names to refer to the vertices.

References add_edge(), and add_vertex().

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &	u,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	v_name,
		typename edge_property_type< Graph >::type const &	p,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

References add_edge(), and add_vertex().

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	u_name,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_descriptor const &	v,
		typename edge_property_type< Graph >::type const &	p,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

References add_edge(), and add_vertex().

template<typename Graph , typename Vertex , typename VertexProperty >

std::pair<typename graph_traits<Graph>::edge_descriptor, bool> boost::graph::add_edge	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	u_name,
		typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	v_name,
		typename edge_property_type< Graph >::type const &	p,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

References add_edge(), and add_vertex().

template<typename Graph , typename Vertex , typename VertexProperty >

disable_if<is_same< typename named_graph<Graph, Vertex, VertexProperty>::vertex_name_type, VertexProperty >,Vertex>::type boost::graph::add_vertex	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	name,
		named_graph< Graph, Vertex, VertexProperty > &	g
	)

Retrieve the vertex associated with the given name, or add a new vertex with that name if no such vertex is available.

Note: This is enabled only when the vertex property type is different from the vertex name to avoid ambiguous overload problems with the add_vertex() function that takes a vertex property.

We found the vertex, so return it

There is no vertex with the given name, so create one

References find_vertex(), and boost::vertex().

Referenced by add_edge().

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::adjacency_iterator, typename vertex_list_adaptor<Graph, GlobalIndexMap>::adjacency_iterator> boost::graph::adjacent_vertices ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by dup_edge_dist(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), and boost::graph::distributed::cc_detail::parallel_connected_components().

template<class PropertyIn , class PropertyOut , class Graph >

void boost::graph::copy_edge_property	(	PropertyIn	p_in,
		PropertyOut	p_out,
		Graph &	g
	)

References BGL_FORALL_EDGES_T, and put().

template<class PropertyIn , class PropertyOut , class Graph >

void boost::graph::copy_vertex_property	(	PropertyIn	p_in,
		PropertyOut	p_out,
		Graph &	g
	)

References BGL_FORALL_VERTICES_T, and put().

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::degree_size_type boost::graph::degree ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::hohberg_vertex_processor< Graph >::initialize_leader(), and boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()().

template<typename Graph >

std::map<unsigned long, unsigned long> boost::graph::degree_dist

(

Graph &

g

)

References BGL_FORALL_VERTICES_T, and out_degree().

template<typename Graph >

std::map<unsigned long, unsigned long> boost::graph::dup_edge_dist

(

Graph &

g

)

References adjacent_vertices(), BGL_FORALL_VERTICES_T, and out_degree().

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::edge_descriptor, bool> boost::graph::edge	(	typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor	u,
		typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor	v,
		vertex_list_adaptor< Graph, GlobalIndexMap > &	g
	)

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

template<typename Graph , typename VertexIterator , typename EdgeIterator >

std::pair<EdgeIterator, EdgeIterator> boost::graph::edges ( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g )

inline

References boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::first_edge, boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::last_edge, and boost::xpressive::make_pair.

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::edge_iterator, typename vertex_list_adaptor<Graph, GlobalIndexMap>::edge_iterator> boost::graph::edges ( const vertex_list_adaptor< Graph, GlobalIndexMap > &  g )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

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

template<typename Graph , typename Vertex , typename VertexProperty >

optional<Vertex> boost::graph::find_vertex	(	typename named_graph< Graph, Vertex, VertexProperty >::vertex_name_type const &	name,
		const named_graph< Graph, Vertex, VertexProperty > &	g
	)

Retrieve the vertex associated with the given name.

Look for a vertex with the given name

Referenced by add_vertex(), and boost::graph::named_graph< Graph, Vertex, VertexProperty >::vertex_by_property().

template<typename Distribution , typename OwnerPropertyMap , typename LocalPropertyMap >

distribution_global_index_map<Distribution, OwnerPropertyMap, LocalPropertyMap>::value_type boost::graph::get ( const distribution_global_index_map< Distribution, OwnerPropertyMap, LocalPropertyMap > &  p, typename distribution_global_index_map< Distribution, OwnerPropertyMap, LocalPropertyMap >::key_type  x  )

inline

References boost::get(), and boost::flyweights::x.

template<typename PropertyTag , typename Graph , typename GlobalIndexMap >

property_map<Graph, PropertyTag>::type boost::graph::get ( PropertyTag  p, vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename PropertyTag , typename Graph , typename GlobalIndexMap >

property_map<Graph, PropertyTag>::const_type boost::graph::get ( PropertyTag  p, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::multiprecision::backends::p.

template<typename PropertyTag , typename Graph , typename GlobalIndexMap >

property_traits< typename property_map<Graph, PropertyTag>::type >::value_type boost::graph::get ( PropertyTag  p, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g, typename property_traits< typename property_map< Graph, PropertyTag >::type >::key_type const &  x  )

inline

References boost::multiprecision::backends::p, and boost::flyweights::x.

template<typename Graph , typename GlobalIndexMap >

GlobalIndexMap boost::graph::get ( vertex_index_t  , const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::vertices_size_type boost::graph::get ( vertex_index_t  , const vertex_list_adaptor< Graph, GlobalIndexMap > &  g, typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  x  )

inline

References boost::flyweights::x.

template<typename Graph >

bool boost::graph::has_no_edges

(

const Graph &

g

)

References edges(), and boost::multiprecision::backends::p.

Referenced by boost::betweenness_centrality_clustering().

template<typename Graph >

bool boost::graph::has_no_out_edges	(	const typename boost::graph_traits< Graph >::vertex_descriptor &	v,
		const Graph &	g
	)

References out_edges(), and boost::multiprecision::backends::p.

template<typename Graph >

bool boost::graph::has_no_vertices

(

const Graph &

g

)

References boost::multiprecision::backends::p, and vertices().

Referenced by boost::cuthill_mckee_ordering(), and boost::king_ordering().

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::degree_size_type boost::graph::in_degree ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::in_edge_iterator, typename vertex_list_adaptor<Graph, GlobalIndexMap>::in_edge_iterator> boost::graph::in_edges ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::detail::initialize_min_in_weights().

template<typename Graph , typename Distribution >

distribution_global_index_map< Distribution, typename property_map<Graph, vertex_owner_t>::const_type, typename property_map<Graph, vertex_local_t>::const_type> boost::graph::make_distribution_global_index_map ( const Graph &  g, const Distribution &  d  )

inline

References boost::vertex_local, and boost::vertex_owner.

template<typename Graph , typename VertexIterator , typename EdgeIterator >

vertex_and_edge_range<Graph, VertexIterator, EdgeIterator> boost::graph::make_vertex_and_edge_range ( const Graph &  g, VertexIterator  first_v, VertexIterator  last_v, EdgeIterator  first_e, EdgeIterator  last_e  )

inline

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap> boost::graph::make_vertex_list_adaptor ( const Graph &  g, const GlobalIndexMap &  index_map  )

inline

template<typename Graph >

vertex_list_adaptor<Graph, typename detail::default_global_index_map<Graph>::type> boost::graph::make_vertex_list_adaptor ( const Graph &  g )

inline

References num_vertices(), and boost::vertex_index.

template<typename Graph >

unsigned long boost::graph::num_dup_edges

(

Graph &

g

)

References BGL_FORALL_EDGES_T, and num_edges().

template<typename Graph , typename VertexIterator , typename EdgeIterator >

vertex_and_edge_range<Graph, VertexIterator, EdgeIterator>::edges_size_type boost::graph::num_edges ( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g )

inline

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::edges_size_type boost::graph::num_edges ( const vertex_list_adaptor< Graph, GlobalIndexMap > &  g )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

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

template<typename Graph , typename VertexIterator , typename EdgeIterator >

vertex_and_edge_range<Graph, VertexIterator, EdgeIterator>::vertices_size_type boost::graph::num_vertices ( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g )

inline

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::vertices_size_type boost::graph::num_vertices ( const vertex_list_adaptor< Graph, GlobalIndexMap > &  g )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::num_vertices().

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::parallel::detail::brandes_betweenness_centrality_dispatch2(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), boost::graph::distributed::build_reverse_graph(), boost::central_point_dominance(), boost::graph::distributed::connected_components(), boost::graph::distributed::crauser_et_al_shortest_paths(), boost::graph::parallel::detail::do_brandes_sssp(), boost::graph::distributed::eager_dijkstra_shortest_paths(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components_impl(), boost::graph::distributed::hohberg_biconnected_components(), make_vertex_list_adaptor(), boost::detail::graph::non_distributed_brandes_betweenness_centrality_dispatch2(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph::distributed::neighboring_tiles_force_pairs< PositionMap >::operator()(), page_rank(), boost::graph::distributed::page_rank_impl(), boost::graph::distributed::cc_detail::parallel_connected_components(), remove_dangling_links(), boost::graph::distributed::remove_dangling_links(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::detail::parallel_dijkstra_impl< ::boost::param_not_found >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), st_connected(), boost::graph::distributed::st_connected(), and boost::graph::distributed::tsin_depth_first_visit().

bool boost::graph::operator!= ( metis_reader::edge_iterator  x, metis_reader::edge_iterator  y  )

inline

References boost::polygon::y().

bool boost::graph::operator== ( metis_reader::edge_iterator  x, metis_reader::edge_iterator  y  )

inline

References boost::graph::metis_reader::num_vertices().

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::degree_size_type boost::graph::out_degree ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::connected_components_ps(), degree_dist(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::delta_stepping_impl(), dup_edge_dist(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::detail::page_rank_step(), remove_dangling_links(), boost::graph::distributed::remove_dangling_links(), and weight_degree_dist().

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::out_edge_iterator, typename vertex_list_adaptor<Graph, GlobalIndexMap>::out_edge_iterator> boost::graph::out_edges ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::vertex_descriptor  v, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::build_reverse_graph(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), has_no_out_edges(), boost::graph::distributed::detail::initialize_min_out_weights(), and boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run().

template<typename Graph , typename RankMap , typename Done , typename RankMap2 >

void boost::graph::page_rank	(	const Graph &	g,
		RankMap	rank_map,
		Done	done,
		typename property_traits< RankMap >::value_type	damping,
		typename graph_traits< Graph >::vertices_size_type	n,
		RankMap2 rank_map2	BOOST_GRAPH_ENABLE_IF_MODELS_PARMGraph, vertex_list_graph_tag
	)

References BGL_FORALL_VERTICES_T, boost::foreach_detail_::done(), boost::graph::detail::page_rank_step(), and put().

Referenced by page_rank().

template<typename Graph , typename RankMap , typename Done >

void boost::graph::page_rank	(	const Graph &	g,
		RankMap	rank_map,
		Done	done,
		typename property_traits< RankMap >::value_type	damping,
		typename graph_traits< Graph >::vertices_size_type	n
	)

References boost::make_iterator_property_map(), num_vertices(), page_rank(), and boost::vertex_index.

template<typename Graph , typename RankMap , typename Done >

void boost::graph::page_rank ( const Graph &  g, RankMap  rank_map, Done  done, typename property_traits< RankMap >::value_type  damping = 0.85  )

inline

References num_vertices(), and page_rank().

template<typename Graph , typename RankMap >

void boost::graph::page_rank ( const Graph &  g, RankMap  rank_map  )

inline

References page_rank().

template<class Property , class Graph >

void boost::graph::property_on_adjacents	(	Property	p,
		const Graph &	g
	)

References BGL_FORALL_INEDGES_T, BGL_FORALL_OUTEDGES_T, BGL_FORALL_VERTICES_T, boost::parallel::request(), source(), boost::synchronize(), and target().

template<class Property , class Graph >

void boost::graph::property_on_inedges	(	Property	p,
		const Graph &	g
	)

References BGL_FORALL_INEDGES_T, BGL_FORALL_VERTICES_T, boost::parallel::request(), and boost::synchronize().

template<class Property , class Graph >

void boost::graph::property_on_outedges	(	Property	p,
		const Graph &	g
	)

References BGL_FORALL_OUTEDGES_T, BGL_FORALL_VERTICES_T, boost::parallel::request(), and boost::synchronize().

template<class Property , class Graph >

void boost::graph::property_on_predecessors	(	Property	p,
		const Graph &	g
	)

References BGL_FORALL_INEDGES_T, BGL_FORALL_VERTICES_T, boost::parallel::request(), source(), and boost::synchronize().

template<class Property , class Graph >

void boost::graph::property_on_successors	(	Property	p,
		const Graph &	g
	)

References BGL_FORALL_OUTEDGES_T, BGL_FORALL_VERTICES_T, boost::parallel::request(), boost::synchronize(), and target().

template<typename PropertyTag , typename Graph , typename GlobalIndexMap >

void boost::graph::put ( PropertyTag  p, vertex_list_adaptor< Graph, GlobalIndexMap > &  g, typename property_traits< typename property_map< Graph, PropertyTag >::type >::key_type const &  x, typename property_traits< typename property_map< Graph, PropertyTag >::type >::value_type const &  v  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base(), and boost::flyweights::x.

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::distributed::build_reverse_graph(), boost::graph::distributed::connected_components_ps(), copy_edge_property(), copy_vertex_property(), boost::graph::distributed::crauser_et_al_shortest_paths(), boost::graph::parallel::detail::do_brandes_sssp(), boost::graph::parallel::detail::do_sequential_brandes_sssp(), boost::graph::distributed::eager_dijkstra_shortest_paths(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::distributed::detail::initialize_min_out_weights(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph::distributed::number_components(), boost::graph::distributed::number_components_from_parents(), boost::graph::add_removed_edge_property< property_map< Graph, edge_capacity_t >::type >::operator()(), page_rank(), boost::graph::distributed::page_rank_impl(), boost::graph::detail::page_rank_step(), boost::graph::distributed::cc_detail::parallel_connected_components(), boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::receive_update(), boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update(), boost::graph::distributed::cc_detail::request_parent_map_entries(), boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), st_connected(), boost::graph::distributed::st_connected(), and boost::graph::distributed::detail::scc_discovery_visitor< Graph, SourceMap >::tree_edge().

template<typename MutableGraph >

void boost::graph::remove_dangling_links

(

MutableGraph &g

BOOST_GRAPH_ENABLE_IF_MODELS_PARMMutableGraph,vertex_list_graph_tag

)

References boost::clear_vertex(), num_vertices(), out_degree(), boost::remove_vertex(), and vertices().

template<typename Graph , typename VertexIterator , typename EdgeIterator >

vertex_and_edge_range<Graph, VertexIterator, EdgeIterator>::vertex_descriptor boost::graph::source ( typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor  e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g  )

inline

References boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::g, and source().

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor boost::graph::source ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::edge_descriptor  e, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::distributed::build_reverse_graph(), boost::graph::parallel::detail::do_brandes_sssp(), boost::graph::parallel::detail::do_sequential_brandes_sssp(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::face_handle(), boost::graph::distributed::hohberg_vertex_processor< Graph >::fill_edge_map(), boost::graph::distributed::hohberg_vertex_processor< Graph >::get_edge_index(), boost::graph::dimacs_basic_reader::incr(), boost::graph::sort_edge_by_origin< Graph >::operator()(), boost::graph::equal_edge< Graph >::operator()(), boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()(), boost::graph::detail::page_rank_step(), property_on_adjacents(), property_on_predecessors(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::push_first(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::push_second(), source(), boost::graph::distributed::hohberg_vertex_processor< Graph >::start_naming_phase(), and boost::graph::distributed::detail::scc_discovery_visitor< Graph, SourceMap >::tree_edge().

template<typename Graph , typename ColorMap >

bool boost::graph::st_connected	(	const Graph &	g,
		typename graph_traits< Graph >::vertex_descriptor	s,
		typename graph_traits< Graph >::vertex_descriptor	t,
		ColorMap	color
	)

References BGL_FORALL_OUTEDGES_T, BGL_FORALL_VERTICES_T, boost::black(), boost::queue< _Tp, _Sequence >::empty(), boost::gray(), boost::green(), boost::queue< _Tp, _Sequence >::pop(), boost::queue< _Tp, _Sequence >::push(), put(), target(), boost::queue< _Tp, _Sequence >::top(), boost::Vertex, and boost::white().

Referenced by st_connected().

template<typename Graph >

bool boost::graph::st_connected ( const Graph &  g, typename graph_traits< Graph >::vertex_descriptor  s, typename graph_traits< Graph >::vertex_descriptor  t  )

inline

References boost::make_two_bit_color_map(), num_vertices(), st_connected(), and boost::vertex_index.

template<class UndirectedGraph , class WeightMap , class ParityMap , class VertexAssignmentMap , class KeyedUpdatablePriorityQueue >

boost::property_traits<WeightMap>::value_type boost::graph::stoer_wagner_min_cut	(	const UndirectedGraph &	g,
		WeightMap	weights,
		ParityMap	parities,
		VertexAssignmentMap	assignments,
		KeyedUpdatablePriorityQueue &	pq
	)

References boost::vertex_index.

template<typename Graph , typename VertexIterator , typename EdgeIterator >

vertex_and_edge_range<Graph, VertexIterator, EdgeIterator>::vertex_descriptor boost::graph::target ( typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor  e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g  )

inline

References boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::g, and target().

template<typename Graph , typename GlobalIndexMap >

vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor boost::graph::target ( typename vertex_list_adaptor< Graph, GlobalIndexMap >::edge_descriptor  e, const vertex_list_adaptor< Graph, GlobalIndexMap > &  g  )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::base().

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::distributed::build_reverse_graph(), boost::graph::distributed::hohberg_vertex_processor< Graph >::echo_phase(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::face_handle(), boost::graph::distributed::hohberg_vertex_processor< Graph >::fill_edge_map(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::graph::distributed::hohberg_vertex_processor< Graph >::get_edge_index(), boost::graph::distributed::hohberg_vertex_processor< Graph >::get_incident_edge_index(), boost::graph::distributed::hohberg_biconnected_components(), boost::graph::distributed::hohberg_vertex_processor< Graph >::initialize_leader(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::sort_edge_by_origin< Graph >::operator()(), boost::graph::equal_edge< Graph >::operator()(), boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()(), property_on_adjacents(), property_on_successors(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::push_first(), boost::graph::detail::face_handle< Graph, StoreOldHandlesPolicy, StoreEmbeddingPolicy >::push_second(), boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), st_connected(), boost::graph::distributed::st_connected(), boost::graph::distributed::hohberg_vertex_processor< Graph >::start_naming_phase(), target(), and boost::graph::distributed::detail::scc_discovery_visitor< Graph, SourceMap >::tree_edge().

template<typename Graph , typename VertexIterator , typename EdgeIterator >

std::pair<VertexIterator, VertexIterator> boost::graph::vertices ( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > &  g )

inline

References boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::first_vertex, boost::graph::vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::last_vertex, and boost::xpressive::make_pair.

template<typename Graph , typename GlobalIndexMap >

std::pair<typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_iterator, typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_iterator> boost::graph::vertices ( const vertex_list_adaptor< Graph, GlobalIndexMap > &  g )

inline

References boost::graph::vertex_list_adaptor< Graph, GlobalIndexMap >::vertices().

Referenced by boost::graph::distributed::boman_et_al_graph_coloring(), boost::graph::parallel::detail::brandes_betweenness_centrality_impl(), boost::graph::distributed::build_reverse_graph(), boost::central_point_dominance(), boost::graph::distributed::connected_components_ps(), boost::graph::distributed::crauser_et_al_shortest_paths(), boost::graph::distributed::eager_dijkstra_shortest_paths(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), has_no_vertices(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph::distributed::number_components(), boost::graph::distributed::page_rank_impl(), boost::random_spanning_tree(), remove_dangling_links(), boost::graph::distributed::remove_dangling_links(), and boost::graph::distributed::detail::parallel_dfs< DistributedGraph, ColorMap, ParentMap, ExploreMap, VertexIndexMap, DFSVisitor >::run().

template<typename Graph >

std::map<unsigned long, double> boost::graph::weight_degree_dist

(

Graph &

g

)

References BGL_FORALL_OUTEDGES_T, BGL_FORALL_VERTICES_T, BOOST_ASSERT, boost::edge_weight, boost::n, and out_degree().