bliss - Man Page
Compute automorphism groups and canonical labelings of graphs
bliss [OPTIONS] [<GRAPH FILE>]
Bliss is an open source tool for computing automorphism groups and canonical forms of graphs. The graphs are specified in DIMACS format.
the input graph is directed
compute canonical form
compute canonical form and output it in file f
set verbosity level to N [N >= 0, default: 1]
select splitting heuristics, where X is:
f first non-singleton cell fl first largest non-singleton cell fs first smallest non-singleton cell fm first maximally non-trivially connected non-singleton cell flm first largest maximally non-trivially connected non-singleton cell fsm first smallest maximally non-trivially connected non-singleton cell (default)
use failure recording? [X=y/n, default: y]
use component recursion? [X=y/n, default: y]
print the version number and exit
print this help and exit
Bliss was written by Tommi Junttila <Tommi.Junttila@tkk.fi> and Petteri Kaski <email@example.com>.
This man page was written by Jerry James <firstname.lastname@example.org>. It is distributed under the same terms as bliss.