Bellman-Ford 单源最短路径算法 Python实现

Bellman-Ford 单源最短路径算法 Python实现

若最短路径不只一条，可寻找到多条最短路径

完整代码：

import numpy as np
import pandas
import numpy
import os
import shutil


def bellmanford(filepath):
    # 读csv数据
    data_read = pandas.read_csv(filepath, dtype='int')

    # 生成列表
    data = data_read.values.tolist()

    # 遍历节点个数
    v_max = max(np.max(data, axis=0)[1], np.max(data, axis=0)[2])
    v = v_max + 1

    # 生成矩阵
    graph = numpy.array(data)

    # 定义邻接矩阵，初始值为无穷大
    D = numpy.zeros((v, v), dtype='float')
    for i in range(v):
        for j in range(v):
            D[i][j] = numpy.inf

    # 根据图G为邻接矩阵赋值
    for i in range(0, len(graph)):
        D[graph[i][1]][graph[i][2]] = graph[i][3]
    for i in range(v):
        D[i][i] = 0

    # 建立前置节点列表
    Pr = [[]for i in range(v)]

    # 建立路长列表, 并初始化原点到各点的路长
    u = numpy.zeros(v, dtype='float')
    for i in range(v):
        u[i] = D[0][i]

    # 暂存列表
    tmp = numpy.zeros(v, dtype='float')

    for x in range(v - 2):
        for i in range(v):
            for j in range(v):
                # 用列表记录下 上一次迭代中原点到各个点的最短路长值u 与 当前各个点到i点的只经过一条边的路长 之和
                tmp[j] = u[j]+D[j][i]
            # 更新原点到各个点的最短路长值
            u[i] = min(tmp)
            if x == v - 3:
                for k in range(v):
                    if tmp[k] == u[i] and k != i:
                        # 用列表储存各点的前置节点，各点的前置节点可能不唯一
                        Pr[i].append(k)

    path_count = numpy.zeros(v, dtype='int')
    path = []
    for i in range(v):
        path.append([])
        path[i].append([i])

    # 根据前置节点列表寻找最短路径（递归实现）
    def find_path(v, v_temp, count):
        if v_temp == 0:
            path_count[v] += 1
            path[v].append([])
            return
        for i in range(len(Pr[v_temp])):
            if path_count[v] > 0:
                if len(path[v][path_count[v]]) == 0:
                    path[v][path_count[v]].extend(path[v][path_count[v]-1][0:(count+1)])
            path[v][path_count[v]].append(Pr[v_temp][i])
            count += 1
            find_path(v, Pr[v_temp][i], count)
            count -= 1

    # 循环打印每个节点的最短路径
    for i in range(1, v):
        find_path(i, i, 0)
        # 去掉列表每一行的最后一个空位置
        path[i].pop()
        for j in range(len(path[i])):
            # 倒序
            path[i][j].reverse()

    if os.path.exists('result2.xlsx'):
        os.remove('result2.xlsx')

    output = open('result2.xlsx', 'w', encoding='gbk')
    output.write('v\t从原点到点v的最短路径\t路径个数\t路长值\n')
    for i in range(1, v):
        output.write(str(i))
        output.write('\t')
        for j in range(len(path[i])):
            output.write(str(path[i][j]))
        output.write('\t')
        output.write(str(len(path[i])))
        output.write('\t')
        output.write(str(u[i]))
        output.write('\n')
    output.close()


if __name__ == '__main__':
    bellmanford('data.csv')

源数据格式：序号-源节点-目的节点-边长值

 最终输出一个.xlsx文件：

目的节点-打印的最短路路径-最短路个数-最短路路长