#include <crauser_et_al_shortest_paths.hpp>
|
| crauser_et_al_dijkstra_queue (const Graph &g, const Combine &combine, const Compare &compare, const VertexIndexMap &id, const DistanceMap &distance_map, const PredecessorMap &predecessor_map, const MinOutWeightMap &min_out_weight, const MinInWeightMap &min_in_weight) |
|
void | push (const value_type &x) |
|
void | update (const value_type &x) |
|
void | pop () |
|
vertex_descriptor & | top () |
|
const vertex_descriptor & | top () const |
|
bool | empty () |
|
bool | do_synchronize () |
|
void | receive_update (process_id_type source, vertex_descriptor vertex, distance_type distance) |
|
void | receive_update (process_id_type source, vertex_descriptor vertex, std::pair< distance_type, vertex_descriptor > p) |
|
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::crauser_et_al_dijkstra_queue |
( |
const Graph & |
g, |
|
|
const Combine & |
combine, |
|
|
const Compare & |
compare, |
|
|
const VertexIndexMap & |
id, |
|
|
const DistanceMap & |
distance_map, |
|
|
const PredecessorMap & |
predecessor_map, |
|
|
const MinOutWeightMap & |
min_out_weight, |
|
|
const MinInWeightMap & |
min_in_weight |
|
) |
| |
|
inline |
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
References boost::parallel::all_reduce(), boost::graph::distributed::all_reduce(), BOOST_ASSERT, boost::relaxed_heap< IndexedType, Compare, ID >::empty(), boost::accumulators::extract::max, boost::process_group(), boost::graph::distributed::process_id(), boost::synchronize(), and boost::relaxed_heap< IndexedType, Compare, ID >::top().
Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::empty().
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
References boost::relaxed_heap< IndexedType, Compare, ID >::contains(), boost::process_group(), boost::graph::distributed::process_id(), boost::relaxed_heap< IndexedType, Compare, ID >::push(), boost::graph::put(), and boost::relaxed_heap< IndexedType, Compare, ID >::update().
Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update().
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
void boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update |
( |
process_id_type |
source, |
|
|
vertex_descriptor |
vertex, |
|
|
std::pair< distance_type, vertex_descriptor > |
p |
|
) |
| |
|
inline |
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap , typename MinOutWeightMap , typename MinInWeightMap >
The documentation for this class was generated from the following file: