#include <dijkstra_shortest_paths.hpp>
Public Types | |
typedef property_traits < DistanceMap >::value_type | D |
typedef property_traits < WeightMap >::value_type | W |
Public Member Functions | |
dijkstra_bfs_visitor (UniformCostVisitor vis, UpdatableQueue &Q, WeightMap w, PredecessorMap p, DistanceMap d, BinaryFunction combine, BinaryPredicate compare, D zero) | |
template<class Edge , class Graph > | |
void | tree_edge (Edge e, Graph &g) |
template<class Edge , class Graph > | |
void | gray_target (Edge e, Graph &g) |
template<class Vertex , class Graph > | |
void | initialize_vertex (Vertex u, Graph &g) |
template<class Edge , class Graph > | |
void | non_tree_edge (Edge, Graph &) |
template<class Vertex , class Graph > | |
void | discover_vertex (Vertex u, Graph &g) |
template<class Vertex , class Graph > | |
void | examine_vertex (Vertex u, Graph &g) |
template<class Edge , class Graph > | |
void | examine_edge (Edge e, Graph &g) |
template<class Edge , class Graph > | |
void | black_target (Edge, Graph &) |
template<class Vertex , class Graph > | |
void | finish_vertex (Vertex u, Graph &g) |
Public Attributes | |
UniformCostVisitor | m_vis |
UpdatableQueue & | m_Q |
WeightMap | m_weight |
PredecessorMap | m_predecessor |
DistanceMap | m_distance |
BinaryFunction | m_combine |
BinaryPredicate | m_compare |
D | m_zero |
typedef property_traits<DistanceMap>::value_type boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::D |
typedef property_traits<WeightMap>::value_type boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::W |
|
inline |
|
inline |
|
inline |
|
inline |
References boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_zero, and boost::throw_exception().
|
inline |
|
inline |
|
inline |
References boost::dijkstra_queue_update(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_distance, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_predecessor, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_Q, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight, boost::relax(), and boost::target().
|
inline |
|
inline |
|
inline |
References boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_distance, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_predecessor, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis, boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight, and boost::relax().
BinaryFunction boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
BinaryPredicate boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
DistanceMap boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_distance |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
PredecessorMap boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_predecessor |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
UpdatableQueue& boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_Q |
UniformCostVisitor boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::discover_vertex(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_vertex(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::finish_vertex(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::initialize_vertex(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
WeightMap boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight |
Referenced by boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::gray_target(), and boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::tree_edge().
D boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_zero |