Ubuntu
metis package

metis 5.1.0.dfsg-7build3 source package in Ubuntu

Changelog

metis (5.1.0.dfsg-7build3) noble; urgency=high

  * No change rebuild against frame pointers and time_t.

 -- Julian Andres Klode <email address hidden>  Mon, 22 Apr 2024 11:48:56 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc
Noble release universe misc

Downloads

File Size SHA-256 Checksum
metis_5.1.0.dfsg.orig.tar.xz 3.4 MiB c50a88b92b01fa3972c5c92cf50117f126c62589b8f793657c7d865c59c23615
metis_5.1.0.dfsg-7build3.debian.tar.xz 8.4 KiB c3533b125c768fbef8a452e1b80a35435f8776425a847f4bc7e73714e739326c
metis_5.1.0.dfsg-7build3.dsc 2.3 KiB 11943efa2f447740d4a131b58a136bd2aec8f5786168c8aa46e609c12c20ee0b

View changes file

Binary packages built by this source

libmetis-dev: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Header

 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. The package contains a header-file.

libmetis-doc: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Documentation

 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. The package contains examples and documentation.

libmetis5: Serial Graph Partitioning and Fill-reducing Matrix Ordering

 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.

libmetis5-dbgsym: debug symbols for libmetis5
metis: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Binaries

 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. The package contains some binaries for graph analyzing.

metis-dbgsym: debug symbols for metis