File: control

package info (click to toggle)
parmetis 4.0.3-5
  • links: PTS, VCS
  • area: non-free
  • in suites: bullseye, buster, sid
  • size: 25,384 kB
  • ctags: 3,256
  • sloc: ansic: 41,872; makefile: 298; sh: 190; perl: 25
file content (77 lines) | stat: -rw-r--r-- 3,110 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
Source: parmetis
Maintainer: Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Adam C. Powell IV <hazelsct@debian.org>,
           Wolfgang Fuetterer <debian@wlf-online.de>
Section: non-free/math
XS-Autobuild: yes
Priority: extra
Build-Depends: debhelper (>> 9),
               mpi-default-dev,
               mpi-default-bin,
               cmake,
               libmetis-dev
Standards-Version: 3.9.8
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/parmetis.git
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/parmetis.git
Homepage: http://glaros.dtc.umn.edu/gkhome/metis/parmetis/overview

Package: libparmetis-dev
Architecture: any
Section: non-free/libdevel
Depends: libparmetis4.0 (= ${binary:Version}),
         ${misc:Depends},
         mpi-default-dev,
         libmetis-dev
Suggests: parmetis-doc
Conflicts: parmetis-dev
Replaces: parmetis-dev
Description: Parallel Graph Partitioning and Sparse Matrix Ordering Libs: Devel
 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices.  It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains files needed to develop programs using ParMetis.

Package: libparmetis4.0
Architecture: any
Section: non-free/libs
Depends: ${shlibs:Depends},
         ${misc:Depends},
         mpi-default-dev
Description: Parallel Graph Partitioning and Sparse Matrix Ordering Shared Libs
 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices.  It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains the ParMetis shared libraries.

Package: parmetis-test
Architecture: any
Depends: ${shlibs:Depends},
         ${misc:Depends},
         libparmetis4.0,
         mpi-default-bin
Recommends: parmetis-doc
Conflicts: pimppa
Description: Parallel Graph Partitioning and Sparse Matrix Ordering Tests
 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices.  It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains programs which test the ParMetis libraries using files
 in the parmetis-doc package's examples directory.

Package: parmetis-doc
Architecture: all
Section: non-free/doc
Depends: ${misc:Depends}
Description: Parallel Graph Partitioning and Sparse Matrix Ordering Lib - Docs
 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices.  It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains the documentation and example files.