| /third_party/boost/boost/graph/ |
| D | neighbor_bfs.hpp | 61 neighbor_bfs_visitor(Visitors vis = Visitors()) : m_vis(vis) {} in neighbor_bfs_visitor()
66 invoke_visitors(m_vis, u, g, on_initialize_vertex()); in initialize_vertex()
71 invoke_visitors(m_vis, u, g, on_discover_vertex()); in discover_vertex()
76 invoke_visitors(m_vis, u, g, on_examine_vertex()); in examine_vertex()
80 invoke_visitors(m_vis, e, g, on_examine_edge()); in examine_out_edge()
84 invoke_visitors(m_vis, e, g, on_tree_edge()); in tree_out_edge()
89 invoke_visitors(m_vis, e, g, on_non_tree_edge()); in non_tree_out_edge()
93 invoke_visitors(m_vis, e, g, on_gray_target()); in gray_target()
97 invoke_visitors(m_vis, e, g, on_black_target()); in black_target()
101 invoke_visitors(m_vis, e, g, on_examine_edge()); in examine_in_edge()
[all …]
|
| D | breadth_first_search.hpp | 161 bfs_visitor(Visitors vis) : m_vis(vis) {} in bfs_visitor()
167 invoke_visitors(m_vis, u, g, ::boost::on_initialize_vertex()); in initialize_vertex()
174 invoke_visitors(m_vis, u, g, ::boost::on_discover_vertex()); in discover_vertex()
181 invoke_visitors(m_vis, u, g, ::boost::on_examine_vertex()); in examine_vertex()
188 invoke_visitors(m_vis, e, g, ::boost::on_examine_edge()); in examine_edge()
195 invoke_visitors(m_vis, e, g, ::boost::on_tree_edge()); in tree_edge()
202 invoke_visitors(m_vis, e, g, ::boost::on_non_tree_edge()); in non_tree_edge()
209 invoke_visitors(m_vis, e, g, ::boost::on_gray_target()); in gray_target()
216 invoke_visitors(m_vis, e, g, ::boost::on_black_target()); in black_target()
223 invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex()); in finish_vertex()
[all …]
|
| D | depth_first_search.hpp | 319 dfs_visitor(Visitors vis) : m_vis(vis) {} in dfs_visitor()
324 invoke_visitors(m_vis, u, g, ::boost::on_initialize_vertex()); in initialize_vertex()
329 invoke_visitors(m_vis, u, g, ::boost::on_start_vertex()); in start_vertex()
334 invoke_visitors(m_vis, u, g, ::boost::on_discover_vertex()); in discover_vertex()
339 invoke_visitors(m_vis, u, g, ::boost::on_examine_edge()); in examine_edge()
343 invoke_visitors(m_vis, u, g, ::boost::on_tree_edge()); in tree_edge()
347 invoke_visitors(m_vis, u, g, ::boost::on_back_edge()); in back_edge()
352 invoke_visitors(m_vis, u, g, ::boost::on_forward_or_cross_edge()); in forward_or_cross_edge()
357 invoke_visitors(m_vis, u, g, ::boost::on_finish_edge()); in finish_edge()
362 invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex()); in finish_vertex()
[all …]
|
| D | bellman_ford_shortest_paths.hpp | 56 bellman_visitor(Visitors vis) : m_vis(vis) {} in bellman_visitor()
60 invoke_visitors(m_vis, u, g, on_examine_edge()); in examine_edge()
64 invoke_visitors(m_vis, u, g, on_edge_relaxed()); in edge_relaxed()
68 invoke_visitors(m_vis, u, g, on_edge_not_relaxed()); in edge_not_relaxed()
72 invoke_visitors(m_vis, u, g, on_edge_minimized()); in edge_minimized()
77 invoke_visitors(m_vis, u, g, on_edge_not_minimized()); in edge_not_minimized()
81 Visitors m_vis; member in boost::bellman_visitor
|
| D | dijkstra_shortest_paths.hpp | 92 invoke_visitors(this->m_vis, e, g, on_edge_relaxed()); in edge_relaxed()
96 invoke_visitors(this->m_vis, e, g, on_edge_not_relaxed()); in edge_not_relaxed()
123 : m_vis(vis) in dijkstra_bfs_visitor()
139 m_vis.edge_relaxed(e, g); in tree_edge()
141 m_vis.edge_not_relaxed(e, g); in tree_edge()
152 m_vis.edge_relaxed(e, g); in gray_target()
155 m_vis.edge_not_relaxed(e, g); in gray_target()
161 m_vis.initialize_vertex(u, g); in initialize_vertex()
167 m_vis.discover_vertex(u, g); in discover_vertex()
172 m_vis.examine_vertex(u, g); in examine_vertex()
[all …]
|
| D | astar_search.hpp | 86 invoke_visitors(this->m_vis, e, g, on_edge_relaxed()); in edge_relaxed()
91 invoke_visitors(this->m_vis, e, g, on_edge_not_relaxed()); in edge_not_relaxed()
131 , m_vis(vis) in astar_bfs_visitor()
147 m_vis.initialize_vertex(u, g); in initialize_vertex()
152 m_vis.discover_vertex(u, g); in discover_vertex()
157 m_vis.examine_vertex(u, g); in examine_vertex()
162 m_vis.finish_vertex(u, g); in finish_vertex()
169 m_vis.examine_edge(e, g); in examine_edge()
185 m_vis.edge_relaxed(e, g); in tree_edge()
191 m_vis.edge_not_relaxed(e, g); in tree_edge()
[all …]
|
| D | maximum_adjacency_search.hpp | 74 mas_visitor(Visitors vis) : m_vis(vis) {} in mas_visitor()
79 invoke_visitors(m_vis, u, g, ::boost::on_initialize_vertex()); in initialize_vertex()
84 invoke_visitors(m_vis, u, g, ::boost::on_start_vertex()); in start_vertex()
89 invoke_visitors(m_vis, e, g, ::boost::on_examine_edge()); in examine_edge()
95 invoke_visitors(m_vis, u, g, ::boost::on_finish_vertex()); in finish_vertex()
104 Visitors m_vis; member in boost::mas_visitor
|
| D | visitors.hpp | 423 return result_type(visitor_list(visitor, m_vis)); \
|
| /third_party/boost/boost/graph/distributed/ |
| D | eager_dijkstra_shortest_paths.hpp | 93 : m_vis(vis), m_Q(Q), m_weight(w), m_predecessor(p), m_distance(d), in parallel_dijkstra_bfs_visitor()
98 { m_vis.initialize_vertex(u, 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()
112 m_vis.examine_edge(e, g); in examine_edge()
132 m_vis.edge_relaxed(e, g); in examine_edge()
134 m_vis.edge_not_relaxed(e, 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; member
|