Searched refs:e_size_t (Results 1 – 6 of 6) sorted by relevance
141 typedef typename Traits::edges_size_type e_size_t; in generate_random_graph1() typedef168 e_size_t not_inserted_counter in generate_random_graph1()170 e_size_t num_vertices_squared = num_vertices(g) * num_vertices(g); in generate_random_graph1()171 for (e_size_t j = 0; j < E; /* Increment in body */) in generate_random_graph1()216 typedef typename Traits::edges_size_type e_size_t; in generate_random_graph() typedef223 e_size_t not_inserted_counter = 0; /* Number of edge insertion failures */ in generate_random_graph()224 e_size_t num_vertices_squared = num_vertices(g) * num_vertices(g); in generate_random_graph()225 for (e_size_t j = 0; j < E; /* Increment in body */) in generate_random_graph()
133 typedef typename graph_traits< Graph >::edges_size_type e_size_t; typedef in boost::edmonds_augmenting_path_finder145 typedef typename map_vertex_to_< e_size_t >::type vertex_to_esize_map_t;190 e_size_t timestamp = 0; in augment_matching()466 std::vector< e_size_t > ancestor_of_v_vector;467 std::vector< e_size_t > ancestor_of_w_vector;
101 typedef typename graph_traits< Graph >::edges_size_type e_size_t; in is_kuratowski_subgraph() typedef124 e_size_t count = 0; in is_kuratowski_subgraph()
106 typedef graph_traits< graph >::edges_size_type e_size_t; in test_graph() typedef120 e_size_t edge_count = 0; in test_graph()
169 typedef graph_traits< graph >::edges_size_type e_size_t; in test_graph() typedef183 e_size_t edge_count = 0; in test_graph()
35 typedef typename graph_traits< Graph >::edges_size_type e_size_t; typedef183 e_size_t m = std::distance(p.first, p.second); in test_edge_list_graph()