FindShortestTour

FindShortestTour[{v1,v2,}]
attempts to find an ordering of the that minimizes the total distance on a tour that visits all the once.

FindShortestTour[graph]
attempts to find an ordering of the vertices in graph that minimizes the total length when visiting each vertex once.

Details and OptionsDetails and Options

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

Find the length and ordering of the shortest tour through points in the plane:

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

Order the points according to the tour found:

In[3]:=
Click for copyable input
Out[3]=

Plot the tour:

In[4]:=
Click for copyable input
Out[4]=

Find the shortest tour in a graph:

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

Highlight the tour:

In[3]:=
Click for copyable input
Out[3]=
Introduced in 2007
(6.0)
| Updated in 2014
(10.0)