bliss 0.73-6 source package in Ubuntu
Changelog
bliss (0.73-6) unstable; urgency=medium
[ Jerome Benoit ]
* Update copyright year-tuples in d/copyright.
* Bump Standards Version to 4.6.2 (no change).
* Update upstream website address.
* Various janitorial changes.
[ Debian Janitor ]
* Remove constraints unnecessary since buster (oldstable):
+ libbliss-dev-common: Drop versioned constraint on libbliss-dev in
Replaces.
+ libbliss-dev-common: Drop versioned constraint on libbliss-dev in Breaks.
+ Remove 2 maintscript entries from 2 files.
-- Jerome Benoit <email address hidden> Sat, 01 Jul 2023 20:37:20 +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 | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| bliss_0.73-6.dsc | 3.0 KiB | c61cb74c60089a0656840a79011873329dd9b7d1e99d41bba096d291bccc3d92 |
| bliss_0.73.orig.tar.xz | 60.4 KiB | f279031bb480f7d0bf0cce475809c42bf1eabe727eebf042e1fa13e3481f91a5 |
| bliss_0.73-6.debian.tar.xz | 12.3 KiB | 9e4cdb65a8120ded1ea621fa72e20adbe6a8a602e6a14c326ed964948906801b |
Available diffs
- diff from 0.73-5 to 0.73-6 (1.5 KiB)
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
