bliss 0.72-3ubuntu0.1 source package in Ubuntu

Changelog

bliss (0.72-3ubuntu0.1) quantal-proposed; urgency=low

  * Force BLISS_USE_GMP to be defined so that user compiled code matches
    the library (LP: #1087771).
 -- David Bremner <email address hidden>   Sat, 08 Dec 2012 10:06:45 +0100

Upload details

Uploaded by:
David Bremner on 2012-12-08
Sponsored by:
Benjamin Drung
Uploaded to:
Quantal
Original maintainer:
Ubuntu Developers
Component:
universe
Architectures:
any
Section:
math
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Quantal updates on 2013-01-11 universe math

Downloads

File Size MD5 Checksum
bliss_0.72.orig.tar.gz 75.2 KiB a0e9c91e9a8d70bd1b504091135bb476
bliss_0.72-3ubuntu0.1.diff.gz 3.9 KiB c94be5f960a78a807da51b8dcc3a6502
bliss_0.72-3ubuntu0.1.dsc 1.9 KiB 37478a7caec50256afabb93309e8247c

View changes file

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