| /third_party/boost/libs/graph_parallel/doc/ |
| D | breadth_first_search.rst | 123 ``tree_edge(e, g)``
129 ``tree_edge`` in a distributed BFS.
134 ``tree_edge`` events in a distributed BFS. See the description of
135 ``tree_edge`` for additional details.
139 As with ``tree_edge`` not knowing when another process has already
166 ``tree_edge`` and ``non_tree_edge`` events to be completely
187 void tree_edge(Edge e, const Graph& g)
208 change with a distributed BFS. The extraneous ``tree_edge`` events
238 void tree_edge(Edge e, const Graph& g)
|
| /third_party/boost/libs/graph/example/ |
| D | dfs.cpp | 59 template < class Edge, class Graph > void tree_edge(Edge e, Graph& G) in tree_edge() function
63 Base::tree_edge(e, G); in tree_edge()
|
| D | cycle-file-dep2.cpp | 49 vis.tree_edge(*ei, g); in dfs_v1()
77 template < typename E, typename G > void tree_edge(E, const G&) {} in tree_edge() function
|
| D | topo-sort-file-dep2.cpp | 47 vis.tree_edge(*ei, g); in dfs_v1()
75 template < typename E, typename G > void tree_edge(E, const G&) {} in tree_edge() function
|
| D | boost_web_graph.cpp | 29 void tree_edge( in tree_edge() function in calc_distance_visitor
59 void tree_edge( in tree_edge() function in print_tree_visitor
|
| D | kevin-bacon2.cpp | 66 void tree_edge(Edge e, const Graph& g) const in tree_edge() function in bacon_number_recorder
|
| D | kevin-bacon.cpp | 28 void tree_edge(Edge e, const Graph& g) const in tree_edge() function in bacon_number_recorder
|
| D | girth.cpp | 76 void tree_edge(edge_descriptor e, Graph* g) in tree_edge() function in diameter_and_girth_visitor
|
| D | parallel-compile-time.cpp | 66 vis.tree_edge(*ei, g); in dfs_v2()
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | depth_first_search.hpp | 44 struct tree_edge { struct
81 … VisitorOps, typename VisitorOps::template tree_edge<mpl::_2, Graph, mpl::first<mpl::_1> >,
|
| D | breadth_first_search.hpp | 49 struct tree_edge { struct
85 … typename VisitorOps::template tree_edge<Edge, Graph, visitor_state>::type>::type,
|
| /third_party/boost/boost/graph/ |
| D | depth_first_search.hpp | 46 vis.tree_edge(e, g); in constraints()
186 vis.tree_edge(*ei, g); in depth_first_visit_impl()
248 vis.tree_edge(*ei, g); in depth_first_visit_impl()
341 template < class Edge, class Graph > void tree_edge(Edge u, const Graph& g) in tree_edge() function in boost::dfs_visitor
|
| D | breadth_first_search.hpp | 44 vis.tree_edge(e, g); in constraints()
90 vis.tree_edge(*ei, g); in breadth_first_visit()
193 graph::bfs_visitor_event_not_overridden tree_edge(Edge e, Graph& g) in tree_edge() function in boost::bfs_visitor
|
| D | undirected_dfs.hpp | 80 vis.tree_edge(*ei, g); in undir_dfv_impl()
148 vis.tree_edge(*ei, g);
|
| D | biconnected_components.hpp | 86 void tree_edge(const Edge& e, Graph& g) in tree_edge() function
99 vis.tree_edge(e, g); in tree_edge()
|
| D | dijkstra_shortest_paths.hpp | 100 template < class Edge, class Graph > void tree_edge(Edge u, Graph& g) {} in tree_edge() function in boost::dijkstra_visitor
134 template < class Edge, class Graph > void tree_edge(Edge e, Graph& g) in tree_edge() function
|
| D | core_numbers.hpp | 82 template < class Edge, class Graph > void tree_edge(Edge, Graph&) {} in tree_edge() function in boost::core_numbers_visitor
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_dfs_test.cpp | 69 void tree_edge(Edge e, const Graph& g) in tree_edge() function
|
| D | distributed_csr_algorithm_test.cpp | 140 void tree_edge(Edge e, const Graph& g) in tree_edge() function
|
| /third_party/boost/libs/msm/example/mpl_graph/ |
| D | breadth_first_search.cpp | 85 struct tree_edge : struct
|
| /third_party/boost/libs/graph/test/ |
| D | bfs.cpp | 70 void tree_edge(const Edge& e, const Graph& g) const in tree_edge() function in bfs_testing_visitor
|
| D | dfs.cpp | 63 template < class Edge, class Graph > void tree_edge(Edge e, Graph& g) in tree_edge() function in dfs_test_visitor
|
| D | undirected_dfs.cpp | 63 template < class Edge, class Graph > void tree_edge(Edge e, Graph& g) in tree_edge() function in dfs_test_visitor
|
| /third_party/boost/boost/graph/distributed/ |
| D | depth_first_search.hpp | 195 vis.tree_edge(*ei, g); in shift_center_of_activity()
|
| /third_party/boost/boost/graph/detail/ |
| D | self_avoiding_walk.hpp | 200 template < class Edge, class Graph > bool tree_edge(Edge e, Graph& G) in tree_edge() function in boost::SAW_visitor
|