迪克斯特拉算法——算法图解

引用算法图解中的原图：

代码如下：

# 迪克斯特拉算法解决权重最短路径算法，不能解决负权重
graph = {}
graph["start"] = {}
graph["start"]["a"] = 6
graph["start"]["b"] = 2

graph["a"] = {}
graph["a"]["fin"] = 1

graph["b"] = {}
graph["b"]["a"] = 3
graph["b"]["fin"] = 5

graph["fin"] = {}

costs = {}
costs["a"] = 6
costs["b"] = 2
costs["fin"] = float('inf')

parent = {}
parent["a"] = "start"
parent["b"] = "start"
parent["fin"] = None
processed = []


def find_lowest_cost_node(costs):
    '''
    在未处理的节点中查找出开销最小的节点
    :param costs:
    :return:
    '''
    lowest_cost = float('inf')
    lowest_cost_node = None
    for node in costs:
        cost = costs[node]
        if cost < lowest_cost and node not in processed:
            lowest_cost = cost
            lowest_cost_node = node
    return lowest_cost_node

node = find_lowest_cost_node(costs)
while node is not None:
    cost = costs[node]
    neighbors = graph[node]
    for n in neighbors.keys():
        new_cost = cost + neighbors[n]
        if costs[n] > new_cost:
            costs[n] = new_cost
            parent[n] = node
    processed.append(node)
    node = find_lowest_cost_node(costs)
print(parent)

运行结果如下：