Re: Problem with package description
(You've reported this against libbliss0d, which barely exists if at
all, but it applies equally to libbliss1d, bliss, and libbliss-dev,
which share the same introductory text.)
That was lazy, and has a reason:
http://ddtp.debian.net/ddt.cgi?desc_id=77987.
Luckily the BTS showed sufficient artificial intelligence to assign
the bug to the appropriate source package.
I prepared two patches for debian/control. The first one implements
Justin's advice. The second one incorporates the upstream text.
One more time: many thanks to Justin.
Martin
--- control.orig 2011-07-25 18:15:13.000000000 +0200
+++ control 2011-07-25 18:27:41.000000000 +0200
@@ -12,11 +12,12 @@
Depends: ${shlibs:Depends}, ${misc:Depends}
Suggests: libbliss-dev
Description: tool to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the command line tool
- bliss; a C++ and C API is also available.
+ Bliss is a backtracking algorithm for labeling a graph, based on
+ individualization and refinement. It provides data structures,
+ subroutines, and pruning heuristics especially for fast handling
+ of large and sparse graphs.
+ .
+ This package provides the command line tool bliss.
Package: libbliss1d
Architecture: any
@@ -24,21 +25,23 @@
Suggests: libbliss-dev
Section: libs
Description: library to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the shared library; a C++
- and C API is also available.
-
+ Bliss is a backtracking algorithm for labeling a graph, based on
+ individualization and refinement. It provides data structures,
+ subroutines, and pruning heuristics especially for fast handling
+ of large and sparse graphs.
+ .
+ This package provides the shared library.
+
Package: libbliss-dev
Architecture: any
Depends: ${misc:Depends}, libbliss1d (=${binary:Version})
Suggests: bliss
Section: libdevel
Description: development files to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the C++ and C API; a
- command line tool is also available.
+ Bliss is a backtracking algorithm for labeling a graph, based on
+ individualization and refinement. It provides data structures,
+ subroutines, and pruning heuristics especially for fast handling
+ of large and sparse graphs.
+ .
+ This package provides the C/C++ development API.
--- control.orig 2011-07-25 18:15:13.000000000 +0200
+++ control 2011-07-25 18:33:21.000000000 +0200
@@ -12,11 +12,12 @@
Depends: ${shlibs:Depends}, ${misc:Depends}
Suggests: libbliss-dev
Description: tool to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the command line tool
- bliss; a C++ and C API is also available.
+ Bliss is a backtracking algorithm for computing automorphism groups
+ and canonical forms of graphs, based on individualization and
+ refinement. Its data structures, subroutines, and pruning heuristics
+ are specially designed for fast handling of large and sparse graphs.
+ .
+ This package provides the command line tool bliss.
Package: libbliss1d
Architecture: any
@@ -24,21 +25,23 @@
Suggests: libbliss-dev
Section: libs
Description: library to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the shared library; a C++
- and C API is also available.
-
+ Bliss is a backtracking algorithm for computing automorphism groups
+ and canonical forms of graphs, based on individualization and
+ refinement. Its data structures, subroutines, and pruning heuristics
+ are specially designed for fast handling of large and sparse graphs.
+ .
+ This package provides the shared library.
+
Package: libbliss-dev
Architecture: any
Depends: ${misc:Depends}, libbliss1d (=${binary:Version})
Suggests: bliss
Section: libdevel
Description: development files to compute graph automorphisms and labelings
- Bliss is a backtracking algorithm based on individualization and
- refinement for labeling a graph. Data structures, subroutines, and
- pruning heuristics especially for fast handling of large and sparse
- graphs are provided. This package provides the C++ and C API; a
- command line tool is also available.
+ Bliss is a backtracking algorithm for computing automorphism groups
+ and canonical forms of graphs, based on individualization and
+ refinement. Its data structures, subroutines, and pruning heuristics
+ are specially designed for fast handling of large and sparse graphs.
+ .
+ This package provides the C/C++ development API.
Reply to: