Wolfram Language & System 10.4 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)

HamiltonianCycle

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

HamiltonianCycle[g]
finds a Hamiltonian cycle in graph if one exists.

HamiltonianCycle[g,All]
gives all Hamiltonian cycles of graph .

DetailsDetails

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=

has been superseded by FindHamiltonianCycle:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=