crauser_et_al_shortest_paths.hpp File Reference

#include <boost/assert.hpp>
#include <boost/graph/distributed/detail/dijkstra_shortest_paths.hpp>
#include <boost/graph/parallel/algorithm.hpp>
#include <functional>
#include <boost/graph/iteration_macros.hpp>
#include <boost/property_map/property_map_iterator.hpp>
#include <boost/type_traits/is_same.hpp>
#include <algorithm>
#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 crauser_et_al_shortest_paths.hpp:

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

Classes
struct	boost::graph::distributed::detail::min_in_distance_compare< Vertex, DistanceMap, MinInWeightMap, Combine, Compare >
struct	boost::graph::distributed::detail::min_out_distance_compare< Vertex, DistanceMap, MinOutWeightMap, Combine, Compare >
class	boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >

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

Functions
template<typename Graph , typename MinInWeightMap , typename WeightMap , typename Inf , typename Compare >
void	boost::graph::distributed::detail::initialize_min_in_weights (const Graph &g, MinInWeightMap min_in_weight, WeightMap weight, Inf inf, Compare compare, directed_tag, incidence_graph_tag)
template<typename Graph , typename MinInWeightMap , typename WeightMap , typename Inf , typename Compare >
void	boost::graph::distributed::detail::initialize_min_in_weights (const Graph &g, MinInWeightMap min_in_weight, WeightMap weight, Inf inf, Compare compare, directed_tag, bidirectional_graph_tag)
template<typename Graph , typename MinInWeightMap , typename WeightMap , typename Inf , typename Compare >
void	boost::graph::distributed::detail::initialize_min_in_weights (const Graph &, MinInWeightMap, WeightMap, Inf, Compare, undirected_tag, bidirectional_graph_tag)
template<typename Graph , typename MinOutWeightMap , typename WeightMap , typename Compare >
void	boost::graph::distributed::detail::initialize_min_out_weights (const Graph &g, MinOutWeightMap min_out_weight, WeightMap weight, Compare compare)
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::crauser_et_al_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, ColorMap color_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)
template<typename DistributedGraph , typename PredecessorMap , typename DistanceMap , typename WeightMap >
void	boost::graph::distributed::crauser_et_al_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight)
template<typename DistributedGraph , typename PredecessorMap , typename DistanceMap >
void	boost::graph::distributed::crauser_et_al_shortest_paths (const DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance)