Searched refs:make_bfs_visitor (Results 1 – 12 of 12) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | breadth_first_search.hpp | 241 bfs_visitor< Visitors > make_bfs_visitor(Visitors vis) in make_bfs_visitor() function
291 make_bfs_visitor(null_visitor())), in apply()
314 make_bfs_visitor(null_vis)), in apply()
366 get_param(params, graph_visitor), make_bfs_visitor(null_visitor())), in breadth_first_visit()
391 arg_pack[_visitor | make_bfs_visitor(null_visitor())], in operator ()()
|
| D | sloan_ordering.hpp | 177 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge())))); in sloan_start_end_vertices()
224 boost::visitor(make_bfs_visitor( in sloan_start_end_vertices()
287 visitor(make_bfs_visitor(record_distances(dist_pmap, on_tree_edge())))); in sloan_ordering()
|
| D | graph_as_tree.hpp | 72 visitor(make_bfs_visitor( in graph_as_tree()
|
| D | edmonds_karp_max_flow.hpp | 102 make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())), in edmonds_karp_max_flow()
|
| D | gursoy_atun_layout.hpp | 123 visitor(boost::make_bfs_visitor( in run()
|
| /third_party/boost/libs/graph/example/ |
| D | dave.cpp | 202 make_bfs_visitor(boost::make_list( in main()
227 visitor(make_bfs_visitor(boost::make_list( in main()
|
| D | visitor.cpp | 98 make_bfs_visitor(std::make_pair(print_edge("tree", on_tree_edge()), in main()
|
| D | city_visitor.cpp | 144 visitor(make_bfs_visitor(boost::make_list( in main()
|
| D | bfs.cpp | 135 boost::visitor(boost::make_bfs_visitor( in main()
|
| D | boost_web_graph.cpp | 198 make_bfs_visitor(record_predecessors(&parent[0], on_tree_edge())))); in main()
|
| /third_party/boost/libs/graph_parallel/example/ |
| D | breadth_first_search.cpp | 86 visitor(make_bfs_visitor(record_distances(distance, on_tree_edge())))); in main()
|
| /third_party/boost/libs/python/src/object/ |
| D | inheritance.cpp | 110 make_bfs_visitor( in distances_to()
|