| 379 | } |
| 380 | |
| 381 | bool dspac::assert_node_range_array_ok(const std::vector<NodeID> &node_range_array) { |
| 382 | int size, rank; |
| 383 | MPI_Comm_size(m_comm, &size); |
| 384 | MPI_Comm_rank(m_comm, &rank); |
| 385 | assert(node_range_array.size() == size + 1); |
| 386 | assert(node_range_array[0] == 0); |
| 387 | assert(node_range_array[size] == m_input_graph.number_of_global_nodes()); |
| 388 | assert(m_input_graph.number_of_local_nodes() == node_range_array[rank + 1] - node_range_array[rank]); |
| 389 | return true; |
| 390 | } |
| 391 | |
| 392 | std::vector<PartitionID> dspac::project_partition(parallel_graph_access &split_graph, const std::vector<EdgeID> &permutation) { |
| 393 | std::vector<PartitionID> edge_partition(m_input_graph.number_of_local_edges()); |
nothing calls this directly
no test coverage detected