Provided by: bliss_0.72-5_amd64

**NAME**

bliss - Compute automorphism groups and canonical labelings of graphs

**SYNOPSIS**

bliss[options] [<graphfile>]

**DESCRIPTION**

Tool for computing automorphism groups and canonical labelings of graphs-directedthe input graph is directed-cancompute canonical form-ocan=fcompute canonical form and output it in file f-v=Nset verbose level to N; N >= 0 and 1 by default-sh=xselect 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 [default] flm first largest maximally non-trivially connected non-singleton cell fsm first smallest maximally non-trivially connected non-singleton cell-versionprint the version number and exit-helpprint help and exit