Home
last modified time | relevance | path

Searched defs:parallel_dijkstra_bfs_visitor (Results 1 – 1 of 1) sorted by relevance

/third_party/boost/boost/graph/distributed/
Deager_dijkstra_shortest_paths.hpp85 struct parallel_dijkstra_bfs_visitor : bfs_visitor<> struct
87 typedef typename property_traits<DistanceMap>::value_type distance_type;
89 parallel_dijkstra_bfs_visitor(UniformCostVisitor vis, Queue& Q, in parallel_dijkstra_bfs_visitor() argument
97 void initialize_vertex(Vertex u, Graph& g) in initialize_vertex()
100 void discover_vertex(Vertex u, Graph& g) { m_vis.discover_vertex(u, g); } in discover_vertex()
102 void examine_vertex(Vertex u, Graph& g) { m_vis.examine_vertex(u, g); } in examine_vertex()
108 void examine_edge(Edge e, Graph& g) { in examine_edge()
137 void finish_vertex(Vertex u, Graph& g) { m_vis.finish_vertex(u, g); } in finish_vertex()
139 UniformCostVisitor m_vis;
140 Queue& m_Q;
[all …]