bliss 0.73-2 source package in Ubuntu

Changelog

bliss (0.73-2) unstable; urgency=medium

  [ Jerome Benoit ]
  * d/control: Standards-Version bump to 4.2.1 (no change).
  * d/control: Vcs-* fields, migration to salsa.
  * d/copyright: Copyright fields, update.
  * d/rules: include pkg-info.mk (simplification).
  * d/adhoc/Makefile: refresh.
  * d/s/lintian-overrides, refresh.
  * d/p/upstream-autotoolization.patch, fix typo.

  [ Jelmer Vernooń≥ ]
  * Use secure copyright file specification URI.
  * Trim trailing whitespace.

 -- Jerome Benoit <email address hidden>  Wed, 14 Nov 2018 10:14:04 +0000

Upload details

Uploaded by:
Debian Science Team on 2018-11-14
Uploaded to:
Sid
Original maintainer:
Debian Science Team
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-11-14 universe math

Downloads

File Size SHA-256 Checksum
bliss_0.73-2.dsc 3.0 KiB 8b23fb83e21b144fc58bda43d24f7dfa0841a245dfc50bb334c50c15737972c3
bliss_0.73.orig.tar.xz 60.4 KiB f279031bb480f7d0bf0cce475809c42bf1eabe727eebf042e1fa13e3481f91a5
bliss_0.73-2.debian.tar.xz 10.8 KiB ad60a9802e69806036bc2305d3a63680adab8f4b44d28421891419f4e8f9aee6

Available diffs

No changes file available.

Binary packages built by this source

bliss: tool to compute graph automorphisms and labelings -- bin

 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.

bliss-dbgsym: debug symbols for bliss
bliss-doc: suite to compute graph automorphisms and labelings -- doc

 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 API documentation.

libbliss-dev: development files to compute graph automorphisms and labelings -- libdev

 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 static library and symbolic links needed
 for development.

libbliss-dev-common: development files to compute graph automorphisms and labelings -- headers

 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++ headers needed for development.

libbliss2: library to compute graph automorphisms and labelings

 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.

libbliss2-dbgsym: debug symbols for libbliss2