1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78

Source: metis
Maintainer: Debian Science Maintainers <debiansciencemaintainers@lists.alioth.debian.org>
Uploaders: Anton Gladky <gladk@debian.org>
Section: libs
Testsuite: autopkgtest
Priority: optional
BuildDepends: cmake,
debhelper (>= 9)
StandardsVersion: 3.9.8
VcsBrowser: https://anonscm.debian.org/cgit/debianscience/packages/metis.git
VcsGit: https://anonscm.debian.org/git/debianscience/packages/metis.git
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
Package: libmetisdev
Architecture: any
Section: libdevel
Depends: libmetis5 (= ${binary:Version}),
${misc:Depends}
Conflicts: libscotchmetisdev
Description: Serial Graph Partitioning and Fillreducing 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
recursivebisection, multilevel kway, and multiconstraint partitioning
schemes. The package contains a headerfile.
Package: libmetisdoc
Architecture: all
Section: doc
Depends: ${misc:Depends}
Description: Serial Graph Partitioning and Fillreducing 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
recursivebisection, multilevel kway, and multiconstraint partitioning
schemes. The package contains examples and documentation.
Package: libmetis5
Architecture: any
MultiArch: same
Depends: ${misc:Depends},
${shlibs:Depends}
PreDepends: ${misc:PreDepends}
Description: Serial Graph Partitioning and Fillreducing 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
recursivebisection, multilevel kway, and multiconstraint partitioning
schemes.
Package: metis
Architecture: any
Section: math
Depends: ${misc:Depends},
${shlibs:Depends},
libmetis5 (= ${binary:Version})
Description: Serial Graph Partitioning and Fillreducing 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
recursivebisection, multilevel kway, and multiconstraint partitioning
schemes. The package contains some binaries for graph analyzing.
Package: libmetis5dbg
Architecture: any
MultiArch: same
Section: debug
Priority: extra
Depends: ${misc:Depends},
${shlibs:Depends},
libmetis5 (= ${binary:Version})
PreDepends: ${misc:PreDepends}
Description: Serial Graph Partitioning and Fillreducing Matrix Ordering. Debugging symbols
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
recursivebisection, multilevel kway, and multiconstraint partitioning
schemes. The package contains debugging symbols.
