Graph partitioning and fill-reducing matrix ordering library
METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.
| Linter | Message | Location |
|---|---|---|
| input-labels Identify input labels that do not match package names | label 'blas' does not match package name 'openblas' |