bliss man page
bliss — Compute automorphism groups and canonical labelings of graphs
Synopsis
bliss [OPTIONS] [<GRAPH FILE>]
Description
Bliss is an open source tool for computing automorphism groups and canonical forms of graphs. The graphs are specified in DIMACS format.
 directed
the input graph is directed
 can
compute canonical form
 ocan=f
compute canonical form and output it in file f
 v=N
set verbosity level to N [N >= 0, default: 1]
 sh=X

select splitting heuristics, where X is:
f first nonsingleton cell fl first largest nonsingleton cell fs first smallest nonsingleton cell fm first maximally nontrivially connected nonsingleton cell flm first largest maximally nontrivially connected nonsingleton cell fsm first smallest maximally nontrivially connected nonsingleton cell (default)  fr=X
use failure recording? [X=y/n, default: y]
 cr=X
use component recursion? [X=y/n, default: y]
 version
print the version number and exit
 help
print this help and exit
Authors
Bliss was written by Tommi Junttila <Tommi.Junttila@tkk.fi> and Petteri Kaski <petteri.kaski@aalto.fi>.
This man page was written by Jerry James <loganjerry@gmail.com>. It is distributed under the same terms as bliss.