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

This is the complete list of members for boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >, including all inherited members.

bfs_visitor()	boost::bfs_visitor<>	inline
bfs_visitor(Visitors vis)	boost::bfs_visitor<>	inline
black_target(Edge e, Graph &g)	boost::bfs_visitor<>	inline
discover_vertex(Vertex u, Graph &g)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
distance_type typedef	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >
examine_edge(Edge e, Graph &g)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
examine_vertex(Vertex u, Graph &g)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
finish_vertex(Vertex u, Graph &g)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
gray_target(Edge e, Graph &g)	boost::bfs_visitor<>	inline
initialize_vertex(Vertex u, Graph &g)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
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::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >
non_tree_edge(Edge e, Graph &g)	boost::bfs_visitor<>	inline
parallel_dijkstra_bfs_visitor(UniformCostVisitor vis, Queue &Q, WeightMap w, PredecessorMap p, DistanceMap d, BinaryFunction combine, BinaryPredicate compare, distance_type zero)	boost::graph::distributed::detail::parallel_dijkstra_bfs_visitor< UniformCostVisitor, Queue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >	inline
tree_edge(Edge e, Graph &g)	boost::bfs_visitor<>	inline