Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Classes | Public Member Functions | List of all members
boost::detail::graph::brandes_unweighted_shortest_paths Struct Reference

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

#include <betweenness_centrality.hpp>

Classes

struct  visitor_type
 Customized visitor passed to breadth-first search, which records predecessor and the number of shortest paths to each vertex. More...
 

Public Member Functions

template<typename Graph , typename IncomingMap , typename DistanceMap , typename PathCountMap , typename VertexIndexMap >
void operator() (Graph &g, typename graph_traits< Graph >::vertex_descriptor s, std::stack< typename graph_traits< Graph >::vertex_descriptor > &ov, IncomingMap incoming, DistanceMap distance, PathCountMap path_count, VertexIndexMap vertex_index)
 

Detailed Description

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

Member Function Documentation

template<typename Graph , typename IncomingMap , typename DistanceMap , typename PathCountMap , typename VertexIndexMap >
void boost::detail::graph::brandes_unweighted_shortest_paths::operator() ( Graph &  g,
typename graph_traits< Graph >::vertex_descriptor  s,
std::stack< typename graph_traits< Graph >::vertex_descriptor > &  ov,
IncomingMap  incoming,
DistanceMap  distance,
PathCountMap  path_count,
VertexIndexMap  vertex_index 
)
inline

References boost::breadth_first_visit(), boost::make_iterator_property_map(), boost::num_vertices(), boost::vertex_index, and boost::visitor().

The documentation for this struct was generated from the following file: