Searched refs:black_target (Results 1 – 8 of 8) sorted by relevance
| /third_party/boost/boost/msm/mpl_graph/ |
| D | breadth_first_search.hpp | 64 struct black_target { struct
92 … typename VisitorOps::template black_target<Edge, Graph, visitor_state>::type>::type,
|
| /third_party/boost/boost/graph/ |
| D | neighbor_bfs.hpp | 47 vis.black_target(e, g); in constraints()
95 template < class Edge, class Graph > void black_target(Edge e, Graph& g) in black_target() function in boost::neighbor_bfs_visitor
184 vis.black_target(e, g); in neighbor_bfs_impl()
|
| D | breadth_first_search.hpp | 47 vis.black_target(e, g); in constraints()
101 vis.black_target(*ei, g); in breadth_first_visit()
214 graph::bfs_visitor_event_not_overridden black_target(Edge e, Graph& g) in black_target() function in boost::bfs_visitor
|
| D | astar_search.hpp | 67 vis.black_target(e, g); in constraints()
214 void black_target(Edge e, const Graph& g) in black_target() function
228 m_vis.black_target(e, g); in black_target()
|
| D | core_numbers.hpp | 80 template < class Vertex, class Graph > void black_target(Vertex, Graph&) {} in black_target() function in boost::core_numbers_visitor
|
| D | dijkstra_shortest_paths.hpp | 209 template < class Edge, class Graph > void black_target(Edge, Graph&) {} in black_target() function
|
| /third_party/boost/libs/graph/test/ |
| D | bfs.cpp | 99 void black_target(const Edge& e, const Graph& g) const in black_target() function in bfs_testing_visitor
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | breadth_first_search.rst | 141 distributed BFS when ``black_target`` events may occur in a
147 ``black_target(e, g)``
|