Serial Graph Partitioning and Fill-reducing Matrix Ordering
METIS is a family of programs for partitioning unstructured graphs and hypergraph and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems.
This is a modified version of Metis for Code-Aster.
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:zhonghuaren/metis-edf && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| metis-edf-4.1-2-Makefile.patch | 0000004269 4.17 KB | |
| metis-edf-4.1-2-configure.patch | 0000001814 1.77 KB | |
| metis-edf-4.1-2.noarch.tar.bz2 | 0000576576 563 KB | |
| metis-edf-4.1-no-return-in-non-void-fix.patch | 0000001114 1.09 KB | |
| metis-edf.spec | 0000003465 3.38 KB |
Latest Revision
Huaren Zhong (zhonghuaren)
committed
(revision 9)
Comments 0