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
Непідтримувані дистрибутиви
Наступні дистрибутиви офіційно не підтримуються. Використовуйте ці пакунки на власний ризик.