dijkstra_shortest_paths.hpp File Reference

#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/overloading.hpp>
#include <boost/graph/distributed/concepts.hpp>
#include <boost/graph/parallel/properties.hpp>
#include <boost/graph/distributed/crauser_et_al_shortest_paths.hpp>
#include <boost/graph/distributed/eager_dijkstra_shortest_paths.hpp>

Include dependency graph for dijkstra_shortest_paths.hpp:

Classes
struct	boost::graph::detail::parallel_dijkstra_impl2< Lookahead >
struct	boost::graph::detail::parallel_dijkstra_impl2< ::boost::param_not_found >
struct	boost::graph::detail::parallel_dijkstra_impl< ColorMap >
struct	boost::graph::detail::parallel_dijkstra_impl< ::boost::param_not_found >

Namespaces
	boost
	Duration formatting facet for input.
	boost::graph
	boost::graph::detail

Functions
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename Compare , typename Combine , typename DistInf , typename DistZero , typename T , typename Tag , typename Base >
void	boost::dijkstra_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &params BOOST_GRAPH_ENABLE_IF_MODELS_PARM(DistributedGraph, distributed_graph_tag))
	Dijkstra's single-source shortest paths algorithm for distributed graphs. More...