HamiltonianCycle[g]
finds a Hamiltonian cycle in graph 
if one exists.
HamiltonianCycle[g,All]
gives all Hamiltonian cycles of graph 
.
HamiltonianCycle
HamiltonianCycle[g]
finds a Hamiltonian cycle in graph 
if one exists.
HamiltonianCycle[g,All]
gives all Hamiltonian cycles of graph 
.
Details and Options
- HamiltonianCycle functionality is now available in the built-in Wolfram Language function FindHamiltonianCycle.
- To use HamiltonianCycle, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
HamiltonianCycle has been superseded by FindHamiltonianCycle:
Text
Wolfram Research (2012), HamiltonianCycle, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.
CMS
Wolfram Language. 2012. "HamiltonianCycle." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.
APA
Wolfram Language. (2012). HamiltonianCycle. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html