#include <dijkstra_shortest_paths.hpp>

Static Public Member Functions
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename ColorMap , typename Compare , typename Combine , typename DistInf , typename DistZero >
static void	run (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, typename property_traits< DistanceMap >::value_type lookahead, WeightMap weight, IndexMap index_map, ColorMap color_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)

Member Function Documentation

template<typename Lookahead >

template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename ColorMap , typename Compare , typename Combine , typename DistInf , typename DistZero >

static void boost::graph::detail::parallel_dijkstra_impl2< Lookahead >::run	(	const DistributedGraph &	g,
		typename graph_traits< DistributedGraph >::vertex_descriptor	s,
		PredecessorMap	predecessor,
		DistanceMap	distance,
		typename property_traits< DistanceMap >::value_type	lookahead,
		WeightMap	weight,
		IndexMap	index_map,
		ColorMap	color_map,
		Compare	compare,
		Combine	combine,
		DistInf	inf,
		DistZero	zero,
		DijkstraVisitor	vis
	)

inlinestatic

References boost::graph::distributed::eager_dijkstra_shortest_paths().

Referenced by boost::graph::detail::parallel_dijkstra_impl< ColorMap >::run().

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

boost_1_57_0/boost/graph/distributed/dijkstra_shortest_paths.hpp

Static Public Member Functions

Member Function Documentation