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
|
Source: parmetis
Section: non-free/math
Priority: extra
Maintainer: Adam C. Powell, IV <hazelsct@debian.org>
Standards-Version: 3.6.1.0
Build-Depends: debhelper (>= 3.0), libmpich1.0-dev
Package: libparmetis-dev
Architecture: any
Section: non-free/libdevel
Depends: libmpich1.0-dev
Suggests: parmetis-doc
Replaces: parmetis-dev
Conflicts: parmetis-dev
Depends: libparmetis3.1 (= ${Source-Version})
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: libparmetis3.1
Architecture: any
Section: non-free/libs
Depends: ${shlibs:Depends}, libmpich1.0
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
Section: non-free/math
Depends: ${shlibs:Depends}
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
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.
|
