Ubuntu
bliss package

bliss 0.77-1 source package in Ubuntu

Changelog

bliss (0.77-1) unstable; urgency=medium

  * New minor upstream version(Closes: #1032936).
  * Debianization:
    - d/watch:
      - URL, add trailing slash;
    - d/patches/*
      - d/upstrean-fix-apparent_forgotten_assert-commented.patch, introduce;
      - d/p/upstream-examples-enumerate-warnings-silence.patch, introduce;
      - d/p/upstream-source-*.patch, refresh;
      - d/p/upstream-autotoolization.patch, reorganize;
      - d/p/debianization.patch, update;
    - d/adhoc/examples/*:
      - d/a/e/Makefile, refresh;
      - d/a/e/enumerate.output, introduce;
    - d/README.Debian, update;
    - d/libbliss2.lintian-overrides:
      - exit-in-shared-library override, obsoleted.

 -- Jerome Benoit <email address hidden>  Sun, 09 Jul 2023 17:16:37 +0000

Upload details

Uploaded by:
Debian Science Maintainers
Uploaded to:
Sid
Original maintainer:
Debian Science Maintainers
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
bliss_0.77-1.dsc 3.0 KiB c6ddc02e5c2e63f72ca6b42a176f5786387e60f03ed24c7d1bd4c054a05d2e04
bliss_0.77.orig.tar.xz 74.5 KiB a84f9d38b1e6c379de675f119d4e139c0d0933adc28be24aeef8a44e3c9b7745
bliss_0.77-1.debian.tar.xz 12.6 KiB bac633180851a829afc2503235c5e3626cea8ceb481d16dd2a362c91fde263e0

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