FindShortestTour

 FindShortestTour({{p11, p12}, {p21, p22}, {p31, p32}, ...})

find a shortest tour in the graph with minimum EuclideanDistance.

See

• Wikipedia - Travelling salesman problem

Examples

>> FindShortestTour({{1,2},{2,3},{3,1}})
{Sqrt(2)+2*Sqrt(5),{1,3,2,1}}

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindShortestTour