TSP使用python

path_map = [[0,10,15,20],[5,9,10],[6,13,12],[8,8,0]]

这是一个示例地图
我认为这是流行的问题,我可以找到解决这个问题的算法在互联网上.但我不能.我试过自己的版本.但我失败了.任何帮助将不胜感激.
这是我到目前为止所拥有的

class TSP:

def __init__(self,init,path_map):
    self.init = init
    self.cost = 0
    self.path_map = path_map
    self.vertices = [i for i in range(1,len(path_map)+1)]

def min_path(self,start):
    if not self.vertices:
        return self.path_map[start-1][init-1]
    else:
        m = [i for i in range(len(self.vertices)+1)]
        i=0
        for v in self.vertices:
            tv = self.vertices.pop(v-1)
            m[i]=self.cost + self.min_path(v)
            self.vertices.insert(v-1,tv)
            i = i + 1
        self.cost = self.cost + min(m)

    return cost `

我得到的,当我尝试运行它时：

>>> t = TSP(1,path_map)
>>> t.min_path(1)
Traceback (most recent call last):
  File "<pyshell#54>",line 1,in <module>
    t.min_path(1)
  File "/home/wanhrust/python/TSP.py",line 42,in min_path
    m[i]=self.cost + self.min_path(v)
  File "/home/wanhrust/python/TSP.py",line 41,in min_path
    tv = self.vertices.pop(v)
IndexError: pop index out of range