Home
last modified time | relevance | path

Searched refs:edge_array (Results 1 – 25 of 341) sorted by relevance

12345678910>>...14

/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
H A Dcity_visitor.cpp103 E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran), in main() local
115 for (std::size_t j = 0; j < sizeof(edge_array)/sizeof(E); ++j) in main()
116 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
118 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N); in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
H A Dcity_visitor.cpp103 E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran), in main() local
115 for (std::size_t j = 0; j < sizeof(edge_array)/sizeof(E); ++j) in main()
116 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
118 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N); in main()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), E(1, 1), E(1, 3), E(2, 1), E(2, 3), E(3, 1), in main() local
58 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
59 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
61 Graph G(edge_array, edge_array + sizeof(edge_array) / sizeof(E), 5); in main()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
H A Dcity_visitor.cpp103 E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran), in main() local
115 for (std::size_t j = 0; j < sizeof(edge_array)/sizeof(E); ++j) in main()
116 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
118 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N); in main()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
H A Dcity_visitor.cpp103 E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran), in main() local
115 for (std::size_t j = 0; j < sizeof(edge_array)/sizeof(E); ++j) in main()
116 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
118 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N); in main()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
H A Dcity_visitor.cpp103 E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran), in main() local
115 for (std::size_t j = 0; j < sizeof(edge_array)/sizeof(E); ++j) in main()
116 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
118 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N); in main()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/example/
H A Ddfs_parenthesis.cpp54 E edge_array[] = { E(0, 2), in main() local
61 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
62 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
64 Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5); in main()
/dports/devel/boost-docs/boost_1_72_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/databases/percona57-server/boost_1_59_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/databases/percona57-client/boost_1_59_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/devel/boost-libs/boost_1_72_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/devel/hyperscan/boost_1_75_0/libs/graph_parallel/test/
H A Ddistributed_st_connected_test.cpp55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/operators/
H A Dbmo_beautify.c48 BMEdge **edge_array; in bmo_beautify_fill_exec() local
61 edge_array = MEM_mallocN( in bmo_beautify_fill_exec()
62 sizeof(*edge_array) * (size_t)BMO_slot_buffer_count(op->slots_in, "edges"), __func__); in bmo_beautify_fill_exec()
71 edge_array[edge_array_len] = e; in bmo_beautify_fill_exec()
77 bm, edge_array, edge_array_len, flag, method, ELE_NEW, FACE_MARK | ELE_NEW); in bmo_beautify_fill_exec()
79 MEM_freeN(edge_array); in bmo_beautify_fill_exec()
/dports/www/osrm-backend/osrm-backend-5.26.0/include/util/
H A Dstatic_graph.hpp147 : node_array(std::move(node_array_)), edge_array(std::move(edge_array_)) in StaticGraph()
153 BOOST_ASSERT(number_of_edges <= edge_array.size()); in StaticGraph()
165 return NodeIterator(edge_array[e].target); in GetTarget()
168 auto &GetEdgeData(const EdgeIterator e) { return edge_array[e].data; } in GetEdgeData()
187 if (to == edge_array[i].target) in FindEdge()
260 std::vector<EdgeID> old_to_new_edge(edge_array.size(), SPECIAL_EDGEID); in Renumber()
266 edge_array[edge].target = old_to_new_node[edge_array[edge].target]; in Renumber()
276 util::inplacePermutation(edge_array.begin(), edge_array.end(), old_to_new_edge); in Renumber()
308 edge_array.resize(number_of_edges); in InitializeFromSortedEdgeRange()
309 std::transform(begin, end, edge_array.begin(), [](const auto &from) { in InitializeFromSortedEdgeRange()
[all …]

12345678910>>...14