- 主頁 [www.tcs.hut.fi]
development files to compute graph automorphisms and labelings -- headers
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++ headers needed for development.