k近邻算法解决最短路径

def print_path(vertexs,lengths):
    path=''
    vertexs=[vertex 1 for vertex in vertexs]
    for i, vertex in enumerate(vertexs):
        path =str(vertex)
        if i== 11:
            break
        path ='->'
    print("最小长度为：",sum(lengths))
    print("路 径：",path)