boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate > Struct Template Reference

#include <eager_dijkstra_shortest_paths.hpp>

Inheritance diagram for boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >:

Collaboration diagram for boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >:

Public Types
typedef property_traits < DistanceMap >::value_type	distance_type

Public Member Functions
	parallel_dijkstra_bfs_visitor (UniformCostVisitor vis, Queue &Q, WeightMap w, PredecessorMap p, DistanceMap d, BinaryFunction combine, BinaryPredicate compare, distance_type zero)
template<class Vertex , class Graph >
void	initialize_vertex (Vertex u, Graph &g)
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 Vertex , class Graph >
void	finish_vertex (Vertex u, Graph &g)
graph::bfs_visitor_event_not_overridden	tree_edge (Edge e, Graph &g)
graph::bfs_visitor_event_not_overridden	non_tree_edge (Edge e, Graph &g)
graph::bfs_visitor_event_not_overridden	gray_target (Edge e, Graph &g)
graph::bfs_visitor_event_not_overridden	black_target (Edge e, Graph &g)

Public Attributes
UniformCostVisitor	m_vis
Queue &	m_Q
WeightMap	m_weight
PredecessorMap	m_predecessor
DistanceMap	m_distance
BinaryFunction	m_combine
BinaryPredicate	m_compare
distance_type	m_zero

Member Typedef Documentation

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

typedef property_traits<DistanceMap>::value_type boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::distance_type

Constructor & Destructor Documentation

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::parallel_dijkstra_bfs_visitor ( UniformCostVisitor  vis, Queue &  Q, WeightMap  w, PredecessorMap  p, DistanceMap  d, BinaryFunction  combine, BinaryPredicate  compare, distance_type  zero  )

inline

Member Function Documentation

graph::bfs_visitor_event_not_overridden boost::bfs_visitor< Visitors >::black_target ( Edge  e, Graph &  g  )

inlineinherited

References boost::invoke_visitors(), and boost::bfs_visitor< Visitors >::m_vis.

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

template<class Vertex , class Graph >

void boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::discover_vertex ( Vertex  u, Graph &  g  )

inline

References boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis.

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

template<class Edge , class Graph >

void boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge ( Edge  e, Graph &  g  )

inline

References boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_distance, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_predecessor, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_Q, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight, boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_zero, boost::relax(), boost::graph::target(), and boost::throw_exception().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

template<class Vertex , class Graph >

void boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_vertex ( Vertex  u, Graph &  g  )

inline

References boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis.

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

template<class Vertex , class Graph >

void boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::finish_vertex ( Vertex  u, Graph &  g  )

inline

References boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis.

graph::bfs_visitor_event_not_overridden boost::bfs_visitor< Visitors >::gray_target ( Edge  e, Graph &  g  )

inlineinherited

References boost::invoke_visitors(), and boost::bfs_visitor< Visitors >::m_vis.

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

template<class Vertex , class Graph >

void boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::initialize_vertex ( Vertex  u, Graph &  g  )

inline

References boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis.

graph::bfs_visitor_event_not_overridden boost::bfs_visitor< Visitors >::non_tree_edge ( Edge  e, Graph &  g  )

inlineinherited

References boost::invoke_visitors(), and boost::bfs_visitor< Visitors >::m_vis.

graph::bfs_visitor_event_not_overridden boost::bfs_visitor< Visitors >::tree_edge ( Edge  e, Graph &  g  )

inlineinherited

References boost::invoke_visitors(), and boost::bfs_visitor< Visitors >::m_vis.

Member Data Documentation

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

BinaryFunction boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_combine

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

BinaryPredicate boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_compare

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

DistanceMap boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_distance

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

PredecessorMap boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_predecessor

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

Queue& boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_Q

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

UniformCostVisitor boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_vis

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::discover_vertex(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_vertex(), boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::finish_vertex(), and boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::initialize_vertex().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

WeightMap boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_weight

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

template<class UniformCostVisitor , class Queue , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate >

distance_type boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::m_zero

Referenced by boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >::examine_edge().

---

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

• boost_1_57_0/boost/graph/distributed/eager_dijkstra_shortest_paths.hpp