delta_stepping_shortest_paths.hpp File Reference

#include <boost/config.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <limits>
#include <list>
#include <vector>
#include <boost/graph/parallel/container_traits.hpp>
#include <boost/graph/parallel/properties.hpp>
#include <boost/graph/distributed/detail/dijkstra_shortest_paths.hpp>
#include <utility>
#include <functional>
#include <boost/graph/parallel/algorithm.hpp>
#include <cassert>
#include <algorithm>
#include <boost/graph/parallel/simple_trigger.hpp>

Include dependency graph for delta_stepping_shortest_paths.hpp:

Classes
class	boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >

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

Functions
template<typename Graph , typename PredecessorMap , typename DistanceMap , typename EdgeWeightMap >
void	boost::graph::distributed::delta_stepping_shortest_paths (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, EdgeWeightMap weight, typename property_traits< EdgeWeightMap >::value_type delta)
template<typename Graph , typename PredecessorMap , typename DistanceMap , typename EdgeWeightMap >
void	boost::graph::distributed::delta_stepping_shortest_paths (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, EdgeWeightMap weight)