metis 5.1.0.dfsg-7build2 source package in Ubuntu
Changelog
metis (5.1.0.dfsg-7build2) jammy; urgency=high * No change rebuild for ppc64el baseline bump. -- Julian Andres Klode <email address hidden> Thu, 24 Mar 2022 17:16:52 +0100
Upload details
- Uploaded by:
- Julian Andres Klode
- Uploaded to:
- Jammy
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Very Urgent
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | misc | |
Lunar | release | universe | misc | |
Jammy | 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-7build2.debian.tar.xz | 8.4 KiB | e9bdf6b85d9081696c77ebcadb66dbbb8c996db8426f7eb4eec3a4281868d3bc |
metis_5.1.0.dfsg-7build2.dsc | 2.3 KiB | 3ad04652ab825c8b0b0c1450477b9270d04c7f310fe2c0341049a40db8493053 |
Available diffs
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: No summary available for metis in ubuntu kinetic.
No description available for metis in ubuntu kinetic.
- metis-dbgsym: debug symbols for metis