Ubuntu
metis package

metis 5.1.0.dfsg-7build1 source package in Ubuntu

Changelog

metis (5.1.0.dfsg-7build1) impish; urgency=medium

  * No-change rebuild to build packages with zstd compression.

 -- Matthias Klose <email address hidden>  Thu, 07 Oct 2021 12:20:45 +0200

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Impish
Original maintainer:
Debian Science Team
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
metis_5.1.0.dfsg.orig.tar.xz 3.4 MiB c50a88b92b01fa3972c5c92cf50117f126c62589b8f793657c7d865c59c23615
metis_5.1.0.dfsg-7build1.debian.tar.xz 8.3 KiB c09ffbd5e6b224e8100c4bef762c621bd38f193e9a3cf87cd1d67933dd70af65
metis_5.1.0.dfsg-7build1.dsc 2.2 KiB a426ff267e9811cf1e39a9779e584b70c1509340294d237a4b67841eb104de6e

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: No summary available for libmetis5-dbgsym in ubuntu impish.

No description available for libmetis5-dbgsym in ubuntu impish.

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