1BLISS(1)                         User Commands                        BLISS(1)
2
3
4

NAME

6       bliss - Compute automorphism groups and canonical labelings of graphs
7

SYNOPSIS

9       bliss [OPTIONS] [<GRAPH FILE>]
10

DESCRIPTION

12       Bliss  is  an  open  source  tool for computing automorphism groups and
13       canonical forms of graphs.  The graphs are specified in DIMACS format.
14
15       -directed
16              the input graph is directed
17
18       -can   compute canonical form
19
20       -ocan=f
21              compute canonical form and output it in file f
22
23       -v=N   set verbosity level to N [N >= 0, default: 1]
24
25       -sh=X  select splitting heuristics, where X is:
26
27                f   first non-singleton cell
28               fl   first largest non-singleton cell
29               fs   first smallest non-singleton cell
30               fm   first maximally non-trivially connected non-singleton cell
31              flm   first largest maximally non-trivially connected
32                    non-singleton cell
33              fsm   first smallest maximally non-trivially connected
34                    non-singleton cell (default)
35
36       -fr=X  use failure recording? [X=y/n, default: y]
37
38       -cr=X  use component recursion? [X=y/n, default: y]
39
40       -version
41              print the version number and exit
42
43       -help  print this help and exit
44

AUTHORS

46       Bliss was written by Tommi Junttila <Tommi.Junttila@tkk.fi> and Petteri
47       Kaski <petteri.kaski@aalto.fi>.
48
49       This man page was written by Jerry James <loganjerry@gmail.com>.  It is
50       distributed under the same terms as bliss.
51
52
53
54Tommi Junttila & Petteri Kaski       0.73                             BLISS(1)