Package: libbliss2 (0.77-3) [debports]

[ Source:  ]

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.

Other Packages Related to libbliss2

• dep: libc6.1 (>= 2.7)

  GNU C Library: Shared libraries
  also a virtual package provided by libc6.1-udeb

• dep: libgcc-s1 (>= 3.4)

  GCC support library

• dep: libgmp10 (>= 2:6.2.1+dfsg1)

  Multiprecision arithmetic library

• dep: libstdc++6 (>= 11)

  GNU Standard C++ Library v3

• rec: bliss (= 0.77-3)

  tool to compute graph automorphisms and labelings -- bin

Download libbliss2

Download for all available architectures

Architecture	Package Size	Installed Size	Files
alpha (unofficial port)	56.6 kB	217.0 kB	[list of files]