Home
last modified time | relevance | path

Searched refs:is_default_param (Results 1 – 11 of 11) sorted by relevance

/third_party/boost/boost/graph/
Dkruskal_min_spanning_tree.hpp130 n = is_default_param(get_param(params, vertex_rank)) ? num_vertices(g) : 1; in kruskal_minimum_spanning_tree()
132 n = is_default_param(get_param(params, vertex_predecessor)) in kruskal_minimum_spanning_tree()
Ddag_shortest_paths.hpp109 n = is_default_param(distance) ? num_vertices(g) : 1; in dag_sp_dispatch1()
111 n = is_default_param(color) ? num_vertices(g) : 1; in dag_sp_dispatch1()
Dedmonds_karp_max_flow.hpp150 size_type n = is_default_param(get_param(params, vertex_color)) in apply()
201 = is_default_param(get_param(params, vertex_predecessor)) in apply()
Ddijkstra_shortest_paths_no_color_map.hpp206 = is_default_param(distance_map) ? num_vertices(graph) : 1; in dijkstra_no_color_map_dispatch1()
Dcopy.hpp411 n = is_default_param(get_param(params, orig_to_copy_t())) in copy_graph()
520 n = is_default_param(get_param(params, orig_to_copy_t())) in copy_component()
Dnamed_function_params.hpp359 template < typename T > inline bool is_default_param(const T&) { return false; } in is_default_param() function
361 inline bool is_default_param(const param_not_found&) { return true; } in is_default_param() function
Dtransitive_closure.hpp292 = is_default_param(g_to_tc_map) ? num_vertices(g) : 1; in transitive_closure_dispatch()
Ddijkstra_shortest_paths.hpp551 = is_default_param(distance) ? num_vertices(g) : 1; in dijkstra_dispatch1()
/third_party/boost/boost/graph/distributed/
Ddijkstra_shortest_paths.hpp186 = is_default_param(get_param(params, vertex_color)); in dijkstra_shortest_paths()
/third_party/boost/libs/graph/doc/
Dtransitive_closure.w145 n = is_default_param(g_to_tc_map) ? num_vertices(g) : 1;
Disomorphism-impl.w1107 n = is_default_param(get_param(params, vertex_isomorphism_t()))