eager_dijkstra_shortest_paths.hpp File Reference

#include <boost/assert.hpp>
#include <boost/graph/distributed/detail/dijkstra_shortest_paths.hpp>
#include <boost/property_map/parallel/caching_property_map.hpp>
#include <boost/pending/indirect_cmp.hpp>
#include <boost/graph/distributed/detail/remote_update_set.hpp>
#include <vector>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/parallel/container_traits.hpp>

Include dependency graph for eager_dijkstra_shortest_paths.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >
class	boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >

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

Functions
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap , typename IndexMap , typename ColorMap , typename Compare , typename Combine , typename DistInf , typename DistZero >
void	boost::graph::distributed::eager_dijkstra_shortest_paths (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)
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap , typename WeightMap >
void	boost::graph::distributed::eager_dijkstra_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, typename property_traits< DistanceMap >::value_type lookahead, WeightMap weight)
template<typename DistributedGraph , typename DijkstraVisitor , typename PredecessorMap , typename DistanceMap >
void	boost::graph::distributed::eager_dijkstra_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, typename property_traits< DistanceMap >::value_type lookahead)