Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Public Types | Public Member Functions | List of all members
boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap > Class Template Reference

#include <eager_dijkstra_shortest_paths.hpp>

Inheritance diagram for boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >:
Inheritance graph
[legend]
Collaboration diagram for boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >:
Collaboration graph
[legend]

Public Types

typedef vertex_descriptor value_type
 

Public Member Functions

 lookahead_dijkstra_queue (const Graph &g, const Combine &combine, const Compare &compare, const VertexIndexMap &id, const DistanceMap &distance_map, const PredecessorMap &predecessor_map, distance_type lookahead)
 
void push (const value_type &x)
 
void update (const value_type &x)
 
void pop ()
 
value_type & top ()
 
const value_type & top () const
 
bool empty ()
 
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)
 

Member Typedef Documentation

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
typedef vertex_descriptor boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::value_type

Constructor & Destructor Documentation

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::lookahead_dijkstra_queue ( const Graph &  g,
const Combine &  combine,
const Compare &  compare,
const VertexIndexMap &  id,
const DistanceMap &  distance_map,
const PredecessorMap &  predecessor_map,
distance_type  lookahead 
)
inline

Member Function Documentation

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
bool boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::empty ( )
inline
template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
void boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::pop ( )
inline

References boost::queue< _Tp, _Sequence >::pop().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
void boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::push ( const value_type &  x)
inline

Referenced by boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::update().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
void boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::receive_update ( process_id_type  source,
vertex_descriptor  vertex,
distance_type  distance 
)
inline

References boost::queue< _Tp, _Sequence >::push(), and boost::graph::put().

Referenced by boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::receive_update().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
void boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::receive_update ( process_id_type  source,
vertex_descriptor  vertex,
std::pair< distance_type, vertex_descriptor >  p 
)
inline

References boost::graph::put(), and boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::receive_update().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
value_type& boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::top ( )
inline

References boost::queue< _Tp, _Sequence >::top().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
const value_type& boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::top ( ) const
inline

References boost::queue< _Tp, _Sequence >::top().

template<typename Graph , typename Combine , typename Compare , typename VertexIndexMap , typename DistanceMap , typename PredecessorMap >
void boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::update ( const value_type &  x)
inline

References boost::graph::distributed::detail::lookahead_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap >::push().

The documentation for this class was generated from the following file: