算法 单源最短路径 dijkstra算法

#!/usr/bin/env python
# -*- coding:utf-8 -*-


graphNodeList = [] #图存储节点信息
graphAdjMatrix = [] #有向权重图邻接矩阵
searchNodeInfo = [] #djstla最短距离已经遍历的节点
dist = [] #存储最短路径开销
p = [] #djstla最短路径每个顶点的直接前驱
MAX = 100000



#str切分后给列表赋值格式
def acquireNode():
    node_list = input("请输入途中所有的点，以空格分隔：")
    for nodeInfo in node_list.strip().split(" "):
        graphNodeList.append(nodeInfo)

#根据输入信息填写邻接矩阵
def acquireSideUndig():
    print("请输入图的所有边信息，格式为边的两个顶点，使用空格分隔。 eg:a b,如果全部信息输入完毕请输入end")
    while True:
        tempSide = input(">:")
        if tempSide.strip().lower() == "end":
            print("输入结束")
            break
        tempNodeList = tempSide.strip().split(" ")
        if len(tempNodeList) == 2:
            if tempNodeList[0] in graphNodeList and tempNodeList[1] in graphNodeList:
                createUndigraphAdjMatrix(tempNodeList[0], tempNodeList[1])
            else:
                print("边信息输入有误，请重新输入")
            continue
        else:
            print("输入有误请重新输入")
            continue

def acquireSideDig():
    print("请输入图的所有边信息，格式为边的两个顶点，使用空格分隔。 eg:a b,如果全部信息输入完毕请输入end")
    while True:
        tempSide = input(">:")
        if tempSide.strip().lower() == "end":
            print("输入结束")
            break
        tempNodeList = tempSide.strip().split(" ")
        if len(tempNodeList) == 2:
            if tempNodeList[0] in graphNodeList and tempNodeList[1] in graphNodeList:
                createDigraphAdjMatrix(tempNodeList[0], tempNodeList[1])
            else:
                print("边信息输入有误，请重新输入")
            continue
        else:
            print("输入有误请重新输入")
            continue

def acquireSideDigWeight():
    print("请输入图的所有边信息，格式为边的两个顶点和权重，使用空格分隔。 eg:a b weight,如果全部信息输入完毕请输入end")
    while True:
        tempSide = input(">:")
        if tempSide.strip().lower() == "end":
            print("输入结束")
            break
        tempNodeList = tempSide.strip().split(" ")
        if len(tempNodeList) == 3:
            if tempNodeList[0] in graphNodeList and tempNodeList[1] in graphNodeList:
                createDigraphAdjMatrixWeight(tempNodeList[0], tempNodeList[1], int(tempNodeList[2]))
            else:
                print("边信息输入有误，请重新输入")
            continue
        else:
            print("输入有误请重新输入")
            continue

#初始化邻接矩阵;注意多维数组初始化格式以及数据的浅拷贝坑
def initGraphAdjMatrixWeight(nodeNum):
    for row in range(nodeNum):
        tempList = []
        for column in range(nodeNum):
            tempList.append(MAX)
        graphAdjMatrix.append(tempList)

#根据输入顶点信息完成邻接表
def createUndigraphAdjMatrix(node0, node1):
    tempIndex1 = graphNodeList.index(node0)
    tempIndex2 = graphNodeList.index(node1)
    graphAdjMatrix[tempIndex1][tempIndex2] = 1
    graphAdjMatrix[tempIndex2][tempIndex1] = 1

def createDigraphAdjMatrix(node0, node1):
    tempIndex1 = graphNodeList.index(node0)
    tempIndex2 = graphNodeList.index(node1)
    graphAdjMatrix[tempIndex1][tempIndex2] = 1

def createDigraphAdjMatrixWeight(node0, node1, weight):
    tempIndex1 = graphNodeList.index(node0)
    tempIndex2 = graphNodeList.index(node1)
    graphAdjMatrix[tempIndex1][tempIndex2] = weight

#pRINT输出空格和换行的写法
def printAdjMatrix(nodeNum):
    for row in range(nodeNum):
        for column in range(nodeNum):
            print(graphAdjMatrix[row][column], end=" ")
        print("")

def maindigAdjMatWeight():
    acquireNode()
    initGraphAdjMatrixWeight(len(graphNodeList))
    acquireSideDigWeight()

def dijkstra(startnode):
    ##初始化
    for node in graphNodeList:
        # 初始化集合S,在集合S中的点在searchNodeInfo对应位置为True，默认初始化为False
        if node == startnode:
            searchNodeInfo.append(True)
        else:
            searchNodeInfo.append(False)
    for index, value in enumerate(graphAdjMatrix[graphNodeList.index(startnode)]):
        # 初始化前驱列表p;将startnode的邻接点前驱初始化为startnode，否则初始化为-1;初始化最短路径长度dist
        dist.append(value)
        if value < MAX:
            p.append(startnode)
        else:
            p.append(-1)
    ##将查找最小邻接点和使用最小邻接点更新dist p列表循环n-1次即可将所有数据更新完毕,起点已经是确定
    for loop in range(len(graphNodeList)-1):
        ##找dist中searchpath为False的最小值.
        tempdist = []
        for index, value in enumerate(searchNodeInfo):
            if value is False:
                tempdist.append(dist[index])
        #根据找到的最小值更新searchPath,判断节点是否查询完成;查询完成程序返回
        tempindex = dist.index(sorted(tempdist)[0])
        searchNodeInfo[tempindex] = True
        if False not in searchNodeInfo:
            printdijkstra(startnode)
            return 0
        #否则使用新加到search的节点更新其邻接点的dist值和p前驱
        for index, value in enumerate(graphAdjMatrix[tempindex]):
            if searchNodeInfo[index] is False and dist[index] > dist[tempindex] + value:
                dist[index] = dist[tempindex] + value
                p[index] = graphNodeList[tempindex]
    printdijkstra(startnode)
#输出原始节点到其它节点的最短路径长度和路径上的顶点
def printdijkstra(startnode):
    for i in range(len(graphNodeList)):
        if i == graphNodeList.index(startnode):
            print("这是起点自己%s" %startnode)
        else:
            print("起始点到顶点%s的距离是%d" %(graphNodeList[i], dist[i]),end="。")
            print("访问路径为:", end=" ")
            temppath = []
            temp_pi = i
            #找到顶点的所有前驱拼接起来即为最优路径
            while True:
                if p[temp_pi] != -1:
                    temppath.append(p[temp_pi])
                    temp_pi = graphNodeList.index(p[temp_pi])

                else:
                    break
            temppath.reverse()
            for path in temppath:
                print("%s->" % path, end="")
            print(graphNodeList[i])

if __name__ == "__main__":
    maindigAdjMatWeight()
    dijkstra(graphNodeList[0])