Searched refs:non_tree_edge (Results 1 – 10 of 10) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | breadth_first_search.hpp | 45 vis.non_tree_edge(e, g); in constraints()
97 vis.non_tree_edge(*ei, g); in breadth_first_visit()
200 graph::bfs_visitor_event_not_overridden non_tree_edge(Edge e, Graph& g) in non_tree_edge() function in boost::bfs_visitor
|
| D | core_numbers.hpp | 84 template < class Edge, class Graph > void non_tree_edge(Edge, Graph&) {} in non_tree_edge() function in boost::core_numbers_visitor
|
| D | astar_search.hpp | 99 void non_tree_edge(Edge e, const Graph& g) in non_tree_edge() function in boost::astar_visitor
172 void non_tree_edge(Edge, const Graph&) in non_tree_edge() function
|
| D | copy.hpp | 472 void non_tree_edge(Edge e, const Graph& g_in) const in non_tree_edge() function
|
| D | betweenness_centrality.hpp | 210 void non_tree_edge(edge_descriptor e, Graph& g) in non_tree_edge() function
|
| D | dijkstra_shortest_paths.hpp | 163 template < class Edge, class Graph > void non_tree_edge(Edge, Graph&) {} in non_tree_edge() function
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | breadth_first_search.rst | 128 ``non_tree_edge`` events in a sequential BFS may become
132 ``non_tree_edge(e, g)``
133 Some ``non_tree_edge`` events in a sequential BFS may become
166 ``tree_edge`` and ``non_tree_edge`` events to be completely
|
| /third_party/boost/libs/graph/example/ |
| D | girth.cpp | 84 void non_tree_edge(edge_descriptor e, Graph* g) in non_tree_edge() function in diameter_and_girth_visitor
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | breadth_first_search.hpp | 54 struct non_tree_edge { struct
|
| /third_party/boost/libs/graph/test/ |
| D | bfs.cpp | 78 void non_tree_edge(const Edge& e, const Graph& g) const in non_tree_edge() function in bfs_testing_visitor
|