1NAUTY-HAMHEURISTIC(1)            Nauty Manual            NAUTY-HAMHEURISTIC(1)
2
3
4

NAME

6       nauty-hamheuristic - try to find hamiltonian cycles in any graphs
7

SYNOPSIS

9       hamheuristic [-sgu] [-vq] [-L#] [-t#] [infile [outfile]]
10

DESCRIPTION

12              Apply a heuristic for finding hamiltonian cycles.
13
14              Output those which are unsuccessful.
15
16       -s     force output to sparse6 format
17
18       -g     force output to graph6 format If neither -s or -g are given, the
19              output format is determined by the header or, if there is  none,
20              by the format of the first input graph.
21
22       -u     Suppress output to outfile, give statistics instead.
23
24              The output file will have a header if and only if the input file
25              does.
26
27       -p     Be content with a hamiltonian path
28
29       -v     Give a cycle or path if one is found.
30
31       -L# Limit number of sideways steps (default 1000+5*n)
32
33       -t# Try # times (default 1)
34
35       -q     suppress auxiliary information
36
37
38
39nauty 2.6.11                     February 2019           NAUTY-HAMHEURISTIC(1)