| /third_party/boost/libs/graph/example/ |
| D | dfs.cpp | 72 void forward_or_cross_edge(Edge e, Graph& G) in forward_or_cross_edge() function
76 Base::forward_or_cross_edge(e, G); in forward_or_cross_edge()
|
| D | cycle-file-dep2.cpp | 55 vis.forward_or_cross_edge(*ei, g); in dfs_v1()
81 template < typename E, typename G > void forward_or_cross_edge(E, const G&) in forward_or_cross_edge() function
|
| D | topo-sort-file-dep2.cpp | 53 vis.forward_or_cross_edge(*ei, g); in dfs_v1()
79 template < typename E, typename G > void forward_or_cross_edge(E, const G&) in forward_or_cross_edge() function
|
| D | parallel-compile-time.cpp | 72 vis.forward_or_cross_edge(*ei, g); in dfs_v2()
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | depth_first_search.hpp | 54 struct forward_or_cross_edge { struct
89 …typename VisitorOps::template forward_or_cross_edge<mpl::_2, Graph, mpl::first<mpl::_1> > >, // B…
|
| /third_party/boost/boost/graph/ |
| D | depth_first_search.hpp | 48 vis.forward_or_cross_edge(e, g); in constraints()
207 vis.forward_or_cross_edge(*ei, g); in depth_first_visit_impl()
254 vis.forward_or_cross_edge(*ei, g); in depth_first_visit_impl()
350 void forward_or_cross_edge(Edge u, const Graph& g) in forward_or_cross_edge() function in boost::dfs_visitor
|
| D | biconnected_components.hpp | 122 void forward_or_cross_edge(const Edge& e, Graph& g) in forward_or_cross_edge() function
124 vis.forward_or_cross_edge(e, g); in forward_or_cross_edge()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | tsin_depth_first_visit.rst | 163 ``forward_or_cross_edge(e, g)``
166 ``forward_or_cross_edge`` events may be received in the distributed
184 ``back_edge`` and ``forward_or_cross_edge`` events to be completely
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_dfs_test.cpp | 81 void forward_or_cross_edge(Edge e, const Graph& g) in forward_or_cross_edge() function
|
| D | distributed_csr_algorithm_test.cpp | 152 void forward_or_cross_edge(Edge e, const Graph& g) in forward_or_cross_edge() function
|
| /third_party/boost/libs/graph/test/ |
| D | dfs.cpp | 76 void forward_or_cross_edge(Edge e, Graph& g) in forward_or_cross_edge() function in dfs_test_visitor
|
| D | undirected_dfs.cpp | 76 void forward_or_cross_edge(Edge e, Graph& g) in forward_or_cross_edge() function in dfs_test_visitor
|
| /third_party/boost/boost/graph/distributed/ |
| D | depth_first_search.hpp | 191 if (target_color == Color::black()) vis.forward_or_cross_edge(*ei, g); in shift_center_of_activity()
|