Home
last modified time | relevance | path

Searched refs:null_vis (Results 1 – 6 of 6) sorted by relevance

/third_party/boost/boost/graph/
Dbellman_ford_shortest_paths.hpp149 bellman_visitor<> null_vis; in bellman_dispatch2() local
164 choose_param(get_param(params, graph_visitor), null_vis)); in bellman_dispatch2()
175 bellman_visitor<> null_vis; in bellman_dispatch2() local
181 choose_param(get_param(params, graph_visitor), null_vis)); in bellman_dispatch2()
Dmaximum_adjacency_search.hpp284 boost::null_visitor null_vis; in apply() local
286 null_vis); in apply()
335 boost::null_visitor null_vis; in apply() local
337 null_vis); in apply()
Dastar_search.hpp430 null_visitor null_vis; in astar_search() local
431 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search()
497 null_visitor null_vis; in astar_search_tree() local
498 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search_tree()
552 null_visitor null_vis; in astar_search_no_init() local
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() local
617 astar_visitor< null_visitor > default_visitor(null_vis); in astar_search_no_init_tree()
Ddag_shortest_paths.hpp133 null_visitor null_vis; in dag_shortest_paths() local
139 get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)), in dag_shortest_paths()
Dneighbor_bfs.hpp273 null_visitor null_vis; in apply() local
281 make_neighbor_bfs_visitor(null_vis)), in apply()
Dbreadth_first_search.hpp307 null_visitor null_vis; in apply() local
314 make_bfs_visitor(null_vis)), in apply()