求最小Hamilton回路功能:在n个顶点的带权图G中，一条Hamilton回路是一顶点序列v1，v2，• • • • vn 其中，每个顶点vi由一条边连到vi+1（i=1，2，• • • • • ，n-1），而vn被连到v1。在所有的Hamilton回路中，寻找一条权值和最小的回路，这条回路就是最小Hamilton回路-circuit for the smallest functional Hamilton : n vertices with the right graph G, a Hamilton Circuit is a sequence of vertices v1, v2,# 8226# 8226# 8226# 8226 T. which each vertex vi even from one side to a vi (i = 1,2,# 8226# 8226# 8226# 8226# 8226, n-1), which was connected to the T. v1. All the Hamilton circuit, finding a value and the right to the smallest circuit, this circuit is the smallest HamiltonianCycle