bliss 0.72-2ubuntu0.1 source package in Ubuntu
Changelog
bliss (0.72-2ubuntu0.1) precise-proposed; urgency=low
* Force BLISS_USE_GMP to be defined so that user compiled code matches
the library (LP: #1087771).
* Link libbliss.so.1d.0 against gmp (Closes: #685390), make above fix
transparent to user.
-- David Bremner <email address hidden> Sat, 08 Dec 2012 10:08:55 +0100
Upload details
- Uploaded by:
- David Bremner
- Sponsored by:
- Benjamin Drung
- Uploaded to:
- Precise
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Precise | updates | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| bliss_0.72.orig.tar.gz | 75.2 KiB | 7c24beee76fd7aad46107faa02760f86c44c907315fe7859c09dbd6fcfbcef5b |
| bliss_0.72-2ubuntu0.1.diff.gz | 3.9 KiB | c1918d67f1407645bcd59eba725cfd0c7eafe2e99e9a0d8cb03a842d610b549f |
| bliss_0.72-2ubuntu0.1.dsc | 1.9 KiB | 3535bfbeb4520483fc7c0fa00c7f042f311e14cdef43e8a611172b833ffe55cf |
Available diffs
- diff from 0.72-2 to 0.72-2ubuntu0.1 (880 bytes)
Binary packages built by this source
- bliss: tool 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 command line tool bliss.
- libbliss-dev: development files 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 C/C++ development API.
- libbliss1d: 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.
- libbliss1d-dbg: debugging symbols for libbliss1d
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 contains the debugging symbols for libliss1d
