bliss 0.77-3build1 source package in Ubuntu
Changelog
bliss (0.77-3build1) noble; urgency=high * No change rebuild against frame pointers and time_t. -- Julian Andres Klode <email address hidden> Mon, 22 Apr 2024 11:40:01 +0200
Upload details
- Uploaded by:
- Julian Andres Klode
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- math
- Urgency:
- Very Urgent
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | math | |
| Noble | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| bliss_0.77.orig.tar.xz | 74.5 KiB | a84f9d38b1e6c379de675f119d4e139c0d0933adc28be24aeef8a44e3c9b7745 |
| bliss_0.77-3build1.debian.tar.xz | 12.8 KiB | f34730e167ac761c24e75cb0eda453c5a750bea7bcc68c34568b664a54544698 |
| bliss_0.77-3build1.dsc | 2.4 KiB | cbbf97d76d53fba368a44345c8c0ac51791699cebbf4e531d8d29f9f66b9c45e |
Available diffs
- diff from 0.77-3 (in Debian) to 0.77-3build1 (536 bytes)
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
