最短路径算法-pyth实现

Dijkstra算法

inf = float('inf')

def dijkatra(grah, start):
    # 当前路径中未求的点
    nodeA = [i for i in range(len(grah))]
    nodeA.remove(start)
    # 当前已经求得最短路径的点
    nodeS = [start]
    # 最短路径字典
    res = {}
    lujin = {}
    # 求到出发点距离最近的点，初始化最短路径res字典
    firstNode = inf
    for i in range(len(grah[start])):
        if grah[start][i] < firstNode:
            firstNode = grah[start][i]
    res[i] = firstNode
    lujin[i] = str(start)+','+str(i)
    nodeS.append(i)
    nodeA.remove(i)
    while nodeA:
        for i in nodeA:
            tmp = inf
            reslujin = ''
            for j in nodeS:
                if j != start:
                    distance = res[j]+grah[j][i]
                    if distance < tmp:
                        tmp = distance
                        reslujin = str(lujin[j])+','+str(i)
            nodeA.remove(i)
            nodeS.append(i)
            res[i] = tmp
            lujin[i] = reslujin
    print(res)
    print(lujin)

if __name__ == '__main__':
    inf = float('inf')
    grah = [[inf, 10, inf, inf,5],[inf, inf, 1, inf, 2],[inf, inf, inf, 4, inf],
            [7, inf, 6, inf, inf],[inf,3, 9, 2, inf]]
    dijkatra(grah, 0)

Floyd算法

def floyd(grah):
    nodes = len(grah[0])
    for i in range(nodes):
        for j in range(nodes):
            if j == i:
                continue
            for k in range(nodes):
                tmp = grah[j][i] + grah[i][k]
                if grah[j][k] > tmp:
                    grah[j][k] = tmp
    print(grah)


if __name__ == '__main__':
    inf = float('inf')
    grah = [[0, 6, 13],[10, 0, 4],[5, inf, 0]]
    floyd(grah)