| /third_party/boost/boost/graph/ |
| D | make_connected.hpp | 29 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in make_connected() typedef
30 typedef iterator_property_map< typename std::vector< v_size_t >::iterator, in make_connected()
34 std::vector< v_size_t > component_vector(num_vertices(g)); in make_connected()
38 v_size_t num_components = connected_components(g, component); in make_connected()
|
| D | max_cardinality_matching.hpp | 48 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in matching_size() typedef
50 v_size_t size_of_matching = 0; in matching_size()
132 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; typedef in boost::edmonds_augmenting_path_finder
144 typedef typename map_vertex_to_< v_size_t >::type vertex_to_vsize_map_t;
462 v_size_t n_vertices;
473 std::vector< v_size_t > ds_rank_vector;
700 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; typedef
765 v_size_t num_odd_vertices = 0; in verify_matching()
777 v_size_t num_odd_components; in verify_matching()
778 detail::odd_components_counter< v_size_t > occ(num_odd_components); in verify_matching()
|
| D | is_kuratowski_subgraph.hpp | 102 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in is_kuratowski_subgraph() typedef
118 v_size_t n_vertices(num_vertices(g)); in is_kuratowski_subgraph()
119 v_size_t max_num_edges(3 * n_vertices - 5); in is_kuratowski_subgraph()
139 for (v_size_t max_size = 2; max_size < 5; ++max_size) in is_kuratowski_subgraph()
|
| D | random.hpp | 140 typedef typename Traits::vertices_size_type v_size_t; in generate_random_graph1() typedef
165 for (v_size_t i = 0; i < V; ++i) in generate_random_graph1()
215 typedef typename Traits::vertices_size_type v_size_t; in generate_random_graph() typedef
220 for (v_size_t i = 0; i < V; ++i) in generate_random_graph()
|
| D | make_maximal_planar.hpp | 31 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; typedef
38 typedef typename std::vector< v_size_t > v_size_vector_t;
172 v_size_t timestamp;
|
| D | chrobak_payne_drawing.hpp | 70 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in chrobak_payne_straight_line_drawing() typedef
72 typedef std::vector< v_size_t > vsize_vector_t; in chrobak_payne_straight_line_drawing()
104 v_size_t timestamp = 1; in chrobak_payne_straight_line_drawing()
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 85 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in back_edge() typedef
93 v_size_t s_low_df_number = get(low, s); in back_edge()
94 v_size_t t_df_number = get(df_number, t); in back_edge()
95 v_size_t s_least_ancestor_df_number = get(least_ancestor, s); in back_edge()
110 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in finish_vertex() typedef
113 v_size_t u_parent_lowpoint = get(low, u_parent); in finish_vertex()
114 v_size_t u_lowpoint = get(low, u); in finish_vertex()
139 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; typedef in boost::boyer_myrvold_impl
165 typedef typename map_vertex_to_< v_size_t >::type vertex_to_v_size_map_t;
245 vertex_to_edge_map_t, v_size_t > in boyer_myrvold_impl()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | bfs-example.cpp | 63 typedef graph_traits< graph_t >::vertices_size_type v_size_t; in main() typedef
64 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| D | bfs-example2.cpp | 74 typedef graph_traits< graph_t >::vertices_size_type v_size_t; in main() typedef
75 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| /third_party/boost/libs/graph/test/ |
| D | weighted_matching_test.cpp | 47 v_size_t; in install() typedef
50 v_size_t i = 0; in install()
|
| D | matching_test.cpp | 53 v_size_t; in install() typedef
56 v_size_t i = 0; in install()
|
| D | random_matching_test.cpp | 32 typedef graph_traits< undirected_graph >::vertices_size_type v_size_t; typedef
|
| D | graph_test.hpp | 33 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; typedef
167 v_size_t n = (size_t)std::distance(p.first, p.second); in test_vertex_list_graph()
|