Searched refs:null_visitor (Results 1 – 18 of 18) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | maximum_adjacency_search.hpp | 70 template < class Visitors = null_visitor > class mas_visitor
284 boost::null_visitor null_vis; in apply()
285 boost::mas_visitor< boost::null_visitor > default_visitor( in apply()
335 boost::null_visitor null_vis; in apply()
336 boost::mas_visitor< boost::null_visitor > default_visitor( in apply()
|
| D | breadth_first_search.hpp | 157 template < class Visitors = null_visitor > class bfs_visitor
291 make_bfs_visitor(null_visitor())), in apply()
307 null_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 | neighbor_bfs.hpp | 58 template < class Visitors = null_visitor > class neighbor_bfs_visitor
260 make_neighbor_bfs_visitor(null_visitor())), in apply()
273 null_visitor null_vis; in apply()
320 make_neighbor_bfs_visitor(null_visitor())), in neighbor_breadth_first_visit()
|
| D | astar_search.hpp | 76 template < class Visitors = null_visitor >
430 null_visitor null_vis; in astar_search()
431 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search()
497 null_visitor null_vis; in astar_search_tree()
498 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search_tree()
552 null_visitor null_vis; in astar_search_no_init()
553 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search_no_init()
616 null_visitor null_vis; in astar_search_no_init_tree()
617 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search_no_init_tree()
|
| D | core_numbers.hpp | 61 template < class Visitors = null_visitor >
334 return core_numbers(g, c, make_core_numbers_visitor(null_visitor())); in core_numbers()
363 g, c, make_core_numbers_visitor(null_visitor())); in weighted_core_numbers()
|
| D | visitors.hpp | 211 struct null_visitor : public base_visitor< null_visitor > struct
|
| D | depth_first_search.hpp | 315 template < class Visitors = null_visitor > class dfs_visitor
398 arg_pack[_visitor | make_dfs_visitor(null_visitor())], in operator ()()
|
| D | dag_shortest_paths.hpp | 133 null_visitor null_vis; in dag_shortest_paths()
|
| D | biconnected_components.hpp | 231 make_dfs_visitor(null_visitor()))); in apply()
254 make_dfs_visitor(null_visitor()))); in apply()
|
| D | dijkstra_shortest_paths_no_color_map.hpp | 193 make_dijkstra_visitor(null_visitor()))); in dijkstra_no_color_map_dispatch2()
|
| D | bellman_ford_shortest_paths.hpp | 52 template < class Visitors = null_visitor > class bellman_visitor
|
| D | dijkstra_shortest_paths.hpp | 83 template < class Visitors = null_visitor >
537 make_dijkstra_visitor(null_visitor())), in dijkstra_dispatch2()
|
| D | undirected_dfs.hpp | 253 get_param(params, graph_visitor), make_dfs_visitor(null_visitor())), in undirected_dfs()
|
| /third_party/boost/libs/graph/example/ |
| D | dfs.cpp | 57 edge_categorizer(const VisitorList& v = null_visitor()) : Base(v) {} in edge_categorizer()
|
| /third_party/boost/libs/graph/test/ |
| D | dijkstra_heap_performance.cpp | 150 make_dijkstra_visitor(null_visitor())); in main()
|
| D | mas_test.cpp | 187 boost::make_mas_visitor(boost::null_visitor()))); in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/geometry/example/ |
| D | 07_b_graph_route_example.cpp | 313 boost::dijkstra_visitor<boost::null_visitor>()); in main()
|
| D | 07_a_graph_route_example.cpp | 327 boost::dijkstra_visitor<boost::null_visitor>()); in main()
|