metis
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.
Δεν υπάρχει επίσημο διαθέσιμο πακέτο για openSUSE Leap 16.0Διανομές
openSUSE Tumbleweed
openSUSE Slowroll
openSUSE Leap 16.0
openSUSE Leap 15.6
SLFO 1.2
openSUSE Backports for SLE 15 SP7
openSUSE Backports for SLE 15 SP4
SUSE SLE-15-SP1
Arch Extra
Μη υποστηριζόμενες διανομές
Οι παρακάτω διανομές δεν υποστηρίζονται επίσημα. Χρησιμοποιήστε αυτά τα πακέτα με δικιά σας ευθύνη.