- 主頁 [www.tcs.hut.fi]
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.
其他與 libbliss-dev 有關的套件
- dep: libbliss1d (= 0.72-5)
- library to compute graph automorphisms and labelings
- sug: bliss
- tool to compute graph automorphisms and labelings