| 34 | } |
| 35 | |
| 36 | void test_adjacency_list_create() |
| 37 | { |
| 38 | std::vector<std::int32_t> edges{1, 2, 0, 0, 1}; |
| 39 | std::vector<std::int32_t> offsets{0, 2, 3, 5}; |
| 40 | graph::AdjacencyList g0(edges, offsets); |
| 41 | |
| 42 | CHECK(std::ranges::equal(g0.links(0), std::vector<std::int32_t>{1, 2})); |
| 43 | CHECK(std::ranges::equal(g0.links(1), std::vector<std::int32_t>{0})); |
| 44 | CHECK(std::ranges::equal(g0.links(2), std::vector<std::int32_t>{0, 1})); |
| 45 | |
| 46 | std::vector<std::int64_t> node_data{-1, 5, -20}; |
| 47 | graph::AdjacencyList g1(edges, offsets, node_data); |
| 48 | CHECK(std::ranges::equal(g1.node_data().value(), node_data)); |
| 49 | } |
| 50 | |
| 51 | void test_comm_graphs() |
| 52 | { |