-----------------------------------------------------------------------------
| 19 | |
| 20 | //----------------------------------------------------------------------------- |
| 21 | graph::AdjacencyList<std::int32_t> |
| 22 | graph::partition_graph(MPI_Comm comm, int nparts, |
| 23 | const AdjacencyList<std::int64_t>& local_graph, |
| 24 | bool ghosting) |
| 25 | { |
| 26 | #if HAS_PARMETIS |
| 27 | return graph::parmetis::partitioner()(comm, nparts, local_graph, ghosting); |
| 28 | #elif HAS_PTSCOTCH |
| 29 | return graph::scotch::partitioner()(comm, nparts, local_graph, ghosting); |
| 30 | #elif HAS_KAHIP |
| 31 | return graph::kahip::partitioner()(comm, nparts, local_graph, ghosting); |
| 32 | #else |
| 33 | // Should never reach this point |
| 34 | #endif |
| 35 | } |
| 36 | //----------------------------------------------------------------------------- |
| 37 | std::tuple<graph::AdjacencyList<std::int64_t>, std::vector<int>, |
| 38 | std::vector<std::int64_t>, std::vector<int>> |
nothing calls this directly
no test coverage detected