套件：libbliss-dev（0.77-3） [debports]
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 有關的套件
|
|
|
|
-
- dep: libbliss-dev-common (= 0.77-3)
- development files to compute graph automorphisms and labelings -- headers
-
- dep: libbliss2 (= 0.77-3)
- library to compute graph automorphisms and labelings
-
- dep: libgmp-dev (>= 2:6.2.0)
- Multiprecision arithmetic library developers tools