 |
BUILT-IN MATHEMATICA SYMBOL
FindHamiltonianCycle[g]
finds a Hamiltonian cycle in the graph g.
FindHamiltonianCycle[g, k]
finds at most k Hamiltonian cycles.
Details and Options
- A Hamiltonian cycle visits each vertex exactly once.
- FindHamiltonianCycle returns a list of paths consisting of Hamiltonian cycles.
- FindHamiltonianCycle returns the list
if no Hamiltonian cycles exist. - FindHamiltonianCycle[g] is equivalent to FindHamiltonianCycle[g, 1].
- FindHamiltonianCycle[g, All] finds all Hamiltonian cycles in the graph g.
New in 8 | Last modified in 9
