Source: metis
Section: libs
Priority: optional
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders:
 Anton Gladky <gladk@debian.org>
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
Standards-Version: 3.9.4
Build-Depends:
 cmake,
 debhelper (>= 9)
Vcs-Git: git://git.debian.org/git/debian-science/packages/metis.git
Vcs-Browser: http://git.debian.org/?p=debian-science/packages/metis.git

Package: libmetis-dev
Section: libdevel
Architecture: any
Depends:
 libmetis5 (= ${binary:Version}),
 ${misc:Depends}
Conflicts: libscotchmetis-dev
Description: 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.

Package: libmetis-doc
Section: doc
Architecture: all
Depends:
 ${misc:Depends}
Description: 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.

Package: libmetis5
Architecture: any
Multi-Arch: same
Pre-Depends:
 ${misc:Pre-Depends}
Depends:
 ${misc:Depends},
 ${shlibs:Depends}
Description: 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.

Package: metis
Section: math
Architecture: any
Depends:
 ${misc:Depends},
 ${shlibs:Depends},
 libmetis5 (= ${binary:Version})
Description: 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.

Package: libmetis5-dbg
Architecture: any
Section: debug
Priority: extra
Multi-Arch: same
Pre-Depends:
 ${misc:Pre-Depends}
Depends:
 ${misc:Depends},
 ${shlibs:Depends},
 libmetis5 (= ${binary:Version})
Description: Serial Graph Partitioning and Fill-reducing 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
 recursive-bisection, multilevel k-way, and multi-constraint partitioning
 schemes. The package contains debugging symbols.
