# DMPlexCSRAlgorithm
The algorithm for building the adjacency graph in CSR format, usually for a mesh partitioner 
## Synopsis
```
typedef enum {
  DM_PLEX_CSR_MAT,
  DM_PLEX_CSR_GRAPH,
  DM_PLEX_CSR_OVERLAP
} DMPlexCSRAlgorithm;
```
Existing shapes include
```none
DM_PLEX_CSR_MAT     - Use `MatPartitioning` by first making a matrix
```
```none
DM_PLEX_CSR_GRAPH   - Use the original `DMPLEX` and communicate along the boundary
```
```none
DM_PLEX_CSR_OVERLAP - Build an overlapped `DMPLEX` and then locally compute
```




## See Also
 `DMPlexCreatePartitionerGraph()`, `PetscPartitionerDMPlexPartition()`, `DMPlexDistribute()`

## Level
beginner

## Location
<A HREF="PETSC_DOC_OUT_ROOT_PLACEHOLDER/include/petscdmplextypes.h.html#DMPlexCSRAlgorithm">include/petscdmplextypes.h</A>


---
[Edit on GitLab](https://gitlab.com/petsc/petsc/-/edit/release/include/petscdmplextypes.h)


[Index of all DMPlex routines](index.md)  
[Table of Contents for all manual pages](/docs/manualpages/index.md)  
[Index of all manual pages](/docs/manualpages/singleindex.md)  
