.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.47.16.
.TH BLISS "1" "December 2020" "bliss (Debian 0.73-5)" "bliss"
.SH NAME
bliss \- compute automorphism groups and canonical labelings of graphs
.SH SYNOPSIS
.B bliss
[\fI\,options\/\fR] [\fI\,<graphfile>\/\fR]
.SH DESCRIPTION
.IP
Run bliss on <graphfile>.
.SH OPTIONS
.TP
\fB\-directed\fR
the input graph is directed
.TP
\fB\-can\fR
compute canonical form
.TP
\fB\-ocan\fR=\fI\,f\/\fR
compute canonical form and output it in file f
.TP
\fB\-v\fR=\fI\,N\/\fR
set verbose level to N [N >= 0, default: 1]
.TP
\fB\-sh\fR=\fI\,X\/\fR
select splitting heuristics, where X is
.TP
f
first non\-singleton cell
.TP
fl
first largest non\-singleton cell
.TP
fs
first smallest non\-singleton cell
.TP
fm
first maximally non\-trivially connected
non\-singleton cell
.TP
flm
first largest maximally non\-trivially connected
non\-singleton cell
.TP
fsm
first smallest maximally non\-trivially connected
non\-singleton cell [default]
.TP
\fB\-fr\fR=\fI\,X\/\fR
use failure recording? [X=y/n, default: y]
.TP
\fB\-cr\fR=\fI\,X\/\fR
use component recursion? [X=y/n, default: y]
.TP
\fB\-version\fR
print the version number and exit
.TP
\fB\-help\fR
print this help and exit
.SH COPYRIGHT
Copyright \(co 2003\-2015 Tommi Junttila.
.PP
License LGPLv3+: GNU LGPL version 3 or later, <http://gnu.org/licenses/lgpl.html>.
This program comes with ABSOLUTELY NO WARRANTY. This is free software,
and you are welcome to redistribute it under certain conditions;
see COPYING and COPYING.LESSER for details.