Home
last modified time | relevance | path

Searched refs:num_edges (Results 1 – 25 of 137) sorted by relevance

123456

/third_party/boost/libs/graph/test/
Dsubgraph_add.cpp87 BOOST_CHECK(num_edges(G0) == 4); in BOOST_AUTO_TEST_CASE()
88 BOOST_CHECK(num_edges(G1) == 1); in BOOST_AUTO_TEST_CASE()
89 BOOST_CHECK(num_edges(G2) == 0); in BOOST_AUTO_TEST_CASE()
93 BOOST_CHECK(num_edges(G0) == 5); in BOOST_AUTO_TEST_CASE()
94 BOOST_CHECK(num_edges(G1) == 2); in BOOST_AUTO_TEST_CASE()
95 BOOST_CHECK(num_edges(G2) == 1); in BOOST_AUTO_TEST_CASE()
251 BOOST_CHECK(num_edges(G0) == 1); in BOOST_AUTO_TEST_CASE()
252 BOOST_CHECK(num_edges(G1) == 1); in BOOST_AUTO_TEST_CASE()
253 BOOST_CHECK(num_edges(G2) == 1); in BOOST_AUTO_TEST_CASE()
262 BOOST_CHECK(num_edges(G0) == 2); in BOOST_AUTO_TEST_CASE()
[all …]
Dmake_connected_test.cpp96 BOOST_TEST(num_edges(gVV) == num_cycles * cycle_size + num_cycles - 1); in main()
112 BOOST_TEST(num_edges(gLV) == num_cycles * cycle_size + num_cycles - 1); in main()
127 BOOST_TEST(num_edges(gVL) == num_cycles * cycle_size + num_cycles - 1); in main()
142 BOOST_TEST(num_edges(gLL) == num_cycles * cycle_size + num_cycles - 1); in main()
147 graph_traits< VVgraph_t >::edges_size_type VV_num_edges(num_edges(gVV)); in main()
149 BOOST_TEST(num_edges(gVV) == VV_num_edges); in main()
151 graph_traits< VLgraph_t >::edges_size_type VL_num_edges(num_edges(gVL)); in main()
153 BOOST_TEST(num_edges(gVL) == VL_num_edges); in main()
155 graph_traits< LVgraph_t >::edges_size_type LV_num_edges(num_edges(gLV)); in main()
157 BOOST_TEST(num_edges(gLV) == LV_num_edges); in main()
[all …]
Dtest_destruction.hpp77 BOOST_ASSERT(num_edges(g) == M - 1); in disconnect_graph()
81 BOOST_ASSERT(num_edges(g) == M - 2); in disconnect_graph()
85 BOOST_ASSERT(num_edges(g) == M - 4); in disconnect_graph()
89 BOOST_ASSERT(num_edges(g) == M - 4); in disconnect_graph()
105 BOOST_ASSERT(boost::num_edges(g) == M - 1); in disconnect_graph()
109 BOOST_ASSERT(boost::num_edges(g) == M - 2); in disconnect_graph()
113 BOOST_ASSERT(boost::num_edges(g) == M - 4); in disconnect_graph()
117 BOOST_ASSERT(boost::num_edges(g) == M - 4); in disconnect_graph()
Dadj_list_loops.cpp26 BOOST_ASSERT(num_edges(g) == 1); in test_graph_nonloop()
28 BOOST_ASSERT(num_edges(g) == 0); in test_graph_nonloop()
42 BOOST_ASSERT(num_edges(g) == 2); in test_multigraph_nonloop()
44 BOOST_ASSERT(num_edges(g) == 0); in test_multigraph_nonloop()
55 BOOST_ASSERT(num_edges(g) == 1); in test_graph_loop()
57 BOOST_ASSERT(num_edges(g) == 0); in test_graph_loop()
69 BOOST_ASSERT(num_edges(g) == 2); in test_multigraph_loop()
71 BOOST_ASSERT(num_edges(g) == 0); in test_multigraph_loop()
Dbidir_remove_edge.cpp30 BOOST_TEST(num_edges(g) == 1); in main()
33 BOOST_TEST(num_edges(g) == 0); in main()
46 BOOST_TEST(num_edges(g) == 1); in main()
48 BOOST_TEST(num_edges(g) == 0); in main()
Dcsr_graph_test.cpp66 BOOST_TEST(num_edges(g1) == num_edges(g2)); in assert_graphs_equal()
208 == num_edges(g2)); in graph_test()
221 == num_edges(g3)); in graph_test()
227 std::vector< std::size_t > sources(num_edges(g2)); in graph_test()
228 std::vector< std::size_t > targets(num_edges(g2)); in graph_test()
244 std::vector< std::size_t > sources(num_edges(g2)); in graph_test()
245 std::vector< std::size_t > targets(num_edges(g2)); in graph_test()
250 sources[num_edges(g2) - 1 - idx] = source(e, g2); in graph_test()
251 targets[num_edges(g2) - 1 - idx] = target(e, g2); in graph_test()
261 std::vector< std::size_t > sources(num_edges(g2)); in graph_test()
[all …]
Drandom_spanning_tree_test.cpp36 edge_style(num_edges(g), get(edge_index, g)); in write_spanning_tree()
73 weight(num_edges(g), get(edge_index, g)); in main()
77 put(weight, e, (1. + get(edge_index, g, e)) / num_edges(g)); in main()
Dgraphml_test.cpp59 BOOST_TEST(num_edges(g) == 9); in main()
89 BOOST_TEST(num_edges(g) == num_edges(g2)); in main()
Drandom_matching_test.cpp56 int num_edges = 0; in main() local
59 while (num_edges < m) in main()
71 num_edges++; in main()
Dgraph_test.hpp182 BOOST_TEST(num_edges(g) == edge_set.size()); in test_edge_list_graph()
184 BOOST_TEST(m == num_edges(g)); in test_edge_list_graph()
272 BOOST_TEST(num_edges(g) == num_edges(cpy) + 1); in test_add_edge()
303 BOOST_TEST(num_edges(g) + occurances == num_edges(cpy)); in test_remove_edge()
320 BOOST_TEST(num_edges(g) + 1 == num_edges(cpy)); in test_remove_edge()
Dbidir_vec_remove_edge.cpp37 BOOST_TEST(num_edges(g) == 2); in main()
41 BOOST_TEST(num_edges(g) == 1); in main()
Dgraph.cpp140 else if (num_edges(g) != count_edges(g)) in check_edge_added()
253 || in_edge_set(g, a, b) || num_edges(g) != count_edges(g); in main()
289 graph_traits< Graph >::edges_size_type old_E = num_edges(g); in main()
298 is_failed = is_failed || old_E != num_edges(g) + 1 in main()
299 || num_edges(g) != count_edges(g); in main()
486 && num_edges(g) == count_edges(g)) in main()
/third_party/boost/libs/graph/example/
Dmodify_graph.cpp75 assert(num_edges(g) == m + 1); in modify_demo()
94 assert(num_edges(g) == m + 2); in modify_demo()
107 assert(num_edges(g) == m + 1); in modify_demo()
120 assert(num_edges(g) == m); in modify_demo()
132 assert(num_edges(g) == m); in modify_demo()
148 assert(num_edges(g) == m + 1); in modify_demo()
152 assert(num_edges(g) == m); in modify_demo()
166 assert(num_edges(g) == m); in modify_demo()
177 assert(num_edges(g) == m); in modify_demo()
Dkruskal-example.cpp26 std::size_t num_edges = sizeof(edge_array) / sizeof(E); in main() local
30 for (std::size_t j = 0; j < num_edges; ++j) in main()
39 Graph g(edge_array, edge_array + num_edges, weights, num_nodes); in main()
Dquick_tour.cpp100 const int num_edges = sizeof(edge_array) / sizeof(edge_array[0]); in main() local
110 for (std::size_t j = 0; j < num_edges; ++j) in main()
120 edge_array, edge_array + num_edges, transmission_delay, num_vertices); in main()
Dmake_biconnected_planar.cpp65 component_storage_t component_storage(num_edges(g)); in main()
82 component_storage.resize(num_edges(g)); in main()
/third_party/boost/libs/graph_parallel/test/
Dadjlist_build_test.cpp122 if (num_edges(g1) != num_edges(g2)) { in test_main()
123 std::cerr << g1.processor() << ": g1 has " << num_edges(g1) in test_main()
124 << " edges, g2 has " << num_edges(g2) << " edges.\n"; in test_main()
212 if (num_edges(g1) != num_edges(g3)) { in test_main()
213 std::cerr << g1.processor() << ": g1 has " << num_edges(g1) in test_main()
214 << " edges, g3 has " << num_edges(g3) << " edges.\n"; in test_main()
Dadjlist_remove_test.cpp74 BOOST_CHECK(num_edges(g) == 0); in test_bidirectional_graph()
113 BOOST_CHECK(num_edges(g) == 3); in test_undirected_graph()
117 BOOST_CHECK(num_edges(g) == 0); in test_undirected_graph()
124 if (num_edges(g) > 0) { in test_undirected_graph()
133 BOOST_CHECK(num_edges(g) == 0); in test_undirected_graph()
Ddistributed_page_rank_test.cpp61 const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); in test_distributed_page_rank() local
64 Graph g(edge_array, edge_array + num_edges, N); in test_distributed_page_rank()
Ddistributed_adjacency_list_test.cpp112 std::cout << "Processor #" << process_id(pg) << ": " << num_edges(g1) in test_main()
161 std::cout << "Processor #" << process_id(pg) << ": " << num_edges(g2) in test_main()
226 std::cout << "Processor #" << process_id(pg) << ": " << num_edges(g3) in test_main()
243 assert(num_edges(g3) == added_edges); in test_main()
/third_party/boost/boost/graph/
Dgrid_graph.hpp438 inline edges_size_type num_edges() const { return (m_num_edges); } in num_edges() function in boost::grid_graph
441 inline edges_size_type num_edges(std::size_t dimension_index) const in num_edges() function in boost::grid_graph
493 edges_size_type dimension_edges = num_edges(0); in edge_at()
499 dimension_edges = num_edges(dimension_index); in edge_at()
504 = ((edge_index / (num_edges(dimension_index) / 2)) == 0); in edge_at()
524 = edge_index % num_edges(dimension_index); in edge_at()
590 edge_index += num_edges(dimension_index); in index_of()
626 edge_index += (num_edges(different_dimension_index) / 2); in index_of()
780 m_num_edges += num_edges(dimension_index); in precalculate()
878 friend inline typename type::edges_size_type num_edges(const type& graph) in num_edges() function
[all …]
Ddimacs.hpp59 instr >> junk >> junk >> num_vertices >> num_edges; in dimacs_basic_reader()
68 , num_edges(0) in dimacs_basic_reader()
109 if (seen_edges > num_edges) in incr()
168 inline vertices_size_type n_edges() { return num_edges; } in n_edges()
243 vertices_size_type num_vertices, num_edges, seen_edges; member in boost::graph::dimacs_basic_reader
/third_party/boost/libs/mpi/test/
Dgraph_topology_test.cpp118 BOOST_CHECK((int)num_edges(graph) == num_edges(graph_comm)); in BOOST_AUTO_TEST_CASE()
/third_party/flutter/skia/third_party/externals/freetype/src/autofit/
Dafhints.c111 if ( axis->num_edges < AF_EDGES_EMBEDDED ) in af_axis_hints_new_edge()
119 else if ( axis->num_edges >= axis->max_edges ) in af_axis_hints_new_edge()
153 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
170 axis->num_edges++; in af_axis_hints_new_edge()
584 AF_Edge limit = edges + axis->num_edges; in af_glyph_hints_dump_edges()
605 if ( axis->num_edges ) in af_glyph_hints_dump_edges()
727 axis->num_edges = 0; in af_glyph_hints_done()
779 hints->axis[0].num_edges = 0; in af_glyph_hints_reload()
781 hints->axis[1].num_edges = 0; in af_glyph_hints_reload()
1301 AF_Edge edge_limit = edges + axis->num_edges; in af_glyph_hints_align_strong_points()
/third_party/freetype/src/autofit/
Dafhints.c111 if ( axis->num_edges < AF_EDGES_EMBEDDED ) in af_axis_hints_new_edge()
119 else if ( axis->num_edges >= axis->max_edges ) in af_axis_hints_new_edge()
153 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
170 axis->num_edges++; in af_axis_hints_new_edge()
584 AF_Edge limit = edges + axis->num_edges; in af_glyph_hints_dump_edges()
605 if ( axis->num_edges ) in af_glyph_hints_dump_edges()
727 axis->num_edges = 0; in af_glyph_hints_done()
779 hints->axis[0].num_edges = 0; in af_glyph_hints_reload()
781 hints->axis[1].num_edges = 0; in af_glyph_hints_reload()
1301 AF_Edge edge_limit = edges + axis->num_edges; in af_glyph_hints_align_strong_points()

123456