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.
| System | Target | Derivation | Build status |
|---|---|---|---|
| x86_64-linux | /gnu/store/kakqbw22k0pmwgnzl3q37ncpqnlkh3l2-metis-5.1.0.drv | ||
| mips64el-linux | /gnu/store/pn4ipi9j3d1iz18bz0bpwj2kr3p1xag8-metis-5.1.0.drv | ||
| i686-linux | /gnu/store/908l2gasmya5zjqclxv5bhknv9xh2pbb-metis-5.1.0.drv | ||
| armhf-linux | /gnu/store/2cpliz496dbhq8920lyzk7ip96lrc04n-metis-5.1.0.drv | ||
| aarch64-linux | /gnu/store/jbh7zk3sxgz34d8b508jlypbvj0w3svr-metis-5.1.0.drv |
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||