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
|
Source: edge-addition-planarity-suite
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Julien Puydt <jpuydt@debian.org>
Section: math
Priority: optional
Standards-Version: 4.2.0
Homepage: https://github.com/graph-algorithms/edge-addition-planarity-suite
Build-Depends: debhelper (>= 11)
Vcs-Git: https://salsa.debian.org/science-team/edge-addition-planarity-suite.git
Vcs-Browser: https://salsa.debian.org/science-team/edge-addition-planarity-suite
Package: libplanarity0
Section: libs
Architecture: any
Multi-Arch: same
Depends: ${misc:Depends}, ${shlibs:Depends}
Description: Library of planarity-related graph algorithms
This library contains the reference implementation of the
Edge Addition Planarity Algorithm, which is the best
linear-time method to embed a planar graph and isolate
planarity obstructions.
.
This package contains the library.
Package: libplanarity-dev
Architecture: any
Multi-Arch: same
Section: libdevel
Depends: ${misc:Depends}, libplanarity0 (= ${binary:Version})
Description: Library of planarity-related graph algorithms (devel files)
This library contains the reference implementation of the
Edge Addition Planarity Algorithm, which is the best
linear-time method to embed a planar graph and isolate
planarity obstructions.
.
This package contains the development files.
Package: planarity
Architecture: any
Depends: libplanarity0 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends}
Description: Program for planarity-related graph algorithms
This package contains a command-line reference implementation of the
Edge Addition Planarity Algorithm, which is the best linear-time
method to embed a planar graph and isolate planarity obstructions.
|
