.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.48.2.
.TH NAUTY-HAMHEURISTIC "1" "March 2021" "nauty 2.7.1" "Nauty Manual"
.SH NAME
nauty-hamheuristic \- try to find hamiltonian cycles in any graphs
.SH SYNOPSIS
.B hamheuristic
[\fI\,-sgu\/\fR] [\fI\,-vq\/\fR] [\fI\,-L#\/\fR] [\fI\,-t#\/\fR] [\fI\,infile \/\fR[\fI\,outfile\/\fR]]
.SH DESCRIPTION
.IP
Apply a heuristic for finding hamiltonian cycles.
.IP
Output those which are unsuccessful.
.TP
\fB\-s\fR
force output to sparse6 format
.TP
\fB\-g\fR
force output to graph6 format
If neither \fB\-s\fR or \fB\-g\fR are given, the output format is
determined by the header or, if there is none, by the
format of the first input graph.
.TP
\fB\-u\fR
Suppress output to outfile, give statistics instead.
.IP
The output file will have a header if and only if the input file does.
.TP
\fB\-p\fR
Be content with a hamiltonian path
.TP
\fB\-v\fR
Give a cycle or path if one is found.
.HP
\fB\-L\fR# Limit number of sideways steps (default 1000+5*n)
.HP
\fB\-t\fR# Try # times (default 1)
.TP
\fB\-q\fR
suppress auxiliary information