File: control

package info (click to toggle)
metis 5.1.0.dfsg-5
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid, stretch
  • size: 13,400 kB
  • ctags: 2,565
  • sloc: ansic: 29,849; makefile: 133; sh: 123
file content (78 lines) | stat: -rw-r--r-- 3,361 bytes parent folder | download
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 <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Anton Gladky <gladk@debian.org>
Section: libs
Testsuite: autopkgtest
Priority: optional
Build-Depends: cmake,
               debhelper (>= 9)
Standards-Version: 3.9.8
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/metis.git
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/metis.git
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview

Package: libmetis-dev
Architecture: any
Section: libdevel
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
Architecture: all
Section: doc
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
Depends: ${misc:Depends},
         ${shlibs:Depends}
Pre-Depends: ${misc:Pre-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
Architecture: any
Section: math
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
Multi-Arch: same
Section: debug
Priority: extra
Depends: ${misc:Depends},
         ${shlibs:Depends},
         libmetis5 (= ${binary:Version})
Pre-Depends: ${misc:Pre-Depends}
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.