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 15.5 官方套件

發行版

openSUSE Tumbleweed

openSUSE Leap 15.5

openSUSE Leap 15.4

SUSE SLE-15-SP2

SUSE SLE-15-SP1

Arch Extra

不支援的發行版本

下列發行版本並未被官方支援。使用這些套件需要自行承擔風險。

SUSE:SLE-12:SLE-Module-Toolchain

SUSE:SLE-15:GA

openSUSE:13.2

openSUSE:ALP:Experimental:Slowroll:Base

openSUSE:Leap:15.0

openSUSE:Leap:15.1

openSUSE:Leap:15.2

openSUSE:Leap:42.1

openSUSE:Leap:42.2

openSUSE:Leap:42.3

SUSE:SLE-12:SLE-Module-Adv-Systems-Management

SUSE:ALP

home:coolo:alp

home:obsgeek0:repos:SLE15:aggregate