# bliss - Man Page

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 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) - -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.