nauty-hamheuristic1
Try to find hamiltonian cycles in any graphs
Usage
hamheuristic [-sgu]
[-vq]
[-V]
[-L#]
[-t#]
[infile
[outfile]]
Overview
|
Apply a heuristic for finding hamiltonian cycles. |
|
|
Output those which are unsuccessful. |
-
-s -
force output to sparse6 format
-
-g -
force output to graph6 format If neither
-sor-gare given, the output format is determined by the header or, if there is none, by the format of the first input graph.
-
-V -
Write those for which a cycle (path with
-p) is found instead
-
-u -
Suppress output to outfile, give statistics instead.
-
The output file will have a header if and only if the input file does.
-
-p -
Be content with a hamiltonian path
-
-v -
Give a cycle or path if one is found.
-L# Limit number of sideways steps (default 1000+5*n)
-t# Try # times (default 1)
-
-q -
suppress auxiliary information
Releases
5 releases since Debian 9 (Stretch); the text changed 4 times.
-V since Debian 13 (Trixie).