boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap > Struct Template Reference

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

#include <betweenness_centrality.hpp>

Public Member Functions
	brandes_dijkstra_shortest_paths (WeightMap weight_map)
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

template<typename WeightMap>
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.

Constructor & Destructor Documentation

template<typename WeightMap>

boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::brandes_dijkstra_shortest_paths ( WeightMap  weight_map )

inline

Member Function Documentation

template<typename WeightMap>

template<typename Graph , typename IncomingMap , typename DistanceMap , typename PathCountMap , typename VertexIndexMap >

void boost::detail::graph::brandes_dijkstra_shortest_paths< WeightMap >::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::dijkstra_shortest_paths(), boost::distance_map(), boost::vertex_index_map(), boost::visitor(), and boost::weight_map().

---

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

• boost_1_57_0/boost/graph/betweenness_centrality.hpp