bliss1
Compute automorphism groups and canonical labelings of graphs
Usage
bliss [options]
[<graphfile>]
Overview
-
Run bliss on <graphfile>.
Options
-
-directed -
the input graph is directed
-
-can -
compute canonical form
-
-ocan=f -
compute canonical form and output it in file f
-
-v=N -
set verbose 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
Releases
7 releases since Debian 7 (Wheezy); the text changed 5 times.
-cr since Debian 9 (Stretch);
-fr since Debian 9 (Stretch).