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:

ffirst non-singleton cell
flfirst largest non-singleton cell
fsfirst smallest non-singleton cell
fmfirst maximally non-trivially connected non-singleton cell
flmfirst largest maximally non-trivially connected
non-singleton cell
fsmfirst smallest maximally non-trivially connected
non-singleton 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.

Info

0.73 Tommi Junttila & Petteri Kaski User Commands