DOLFIN-X
DOLFIN-X C++ interface
|
Tools for partitioning meshes. More...
Functions | |
graph::AdjacencyList< std::int32_t > | partition_cells (MPI_Comm comm, int n, const mesh::CellType cell_type, const graph::AdjacencyList< std::int64_t > &cells, mesh::GhostMode ghost_mode) |
Compute destination rank for mesh cells in this rank using a graph partitioner. More... | |
Tools for partitioning meshes.
graph::AdjacencyList< std::int32_t > dolfinx::mesh::Partitioning::partition_cells | ( | MPI_Comm | comm, |
int | n, | ||
const mesh::CellType | cell_type, | ||
const graph::AdjacencyList< std::int64_t > & | cells, | ||
mesh::GhostMode | ghost_mode | ||
) |
Compute destination rank for mesh cells in this rank using a graph partitioner.
[in] | comm | MPI Communicator |
[in] | n | Number of partitions |
[in] | cell_type | Cell type |
[in] | cells | Cells on this process. The ith entry in list contains the global indices for the cell vertices. Each cell can appear only once across all processes. The cell vertex indices are not necessarily contiguous globally, i.e. the maximum index across all processes can be greater than the number of vertices. High-order 'nodes', e.g. mid-side points, should not be included. |
[in] | ghost_mode | How to overlap the cell partitioning: none, shared_facet or shared_vertex |