狄克斯特拉--最短路径问题

最新推荐文章于 2024-08-08 15:12:59 发布

young_s%

最新推荐文章于 2024-08-08 15:12:59 发布

阅读量424

点赞数

分类专栏： python algorithm 文章标签：算法

本文链接：https://blog.csdn.net/weixin_45331269/article/details/129290432

版权

python 同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

algorithm

4 篇文章 0 订阅

订阅专栏

文章介绍了Dijkstra算法，用于解决从起点到终点的最短路径问题。通过一个图示例子和对应的Python代码实现，详细阐述了算法的四步流程：找到最小成本节点、更新邻居节点成本、重复此过程以及计算最终路径。代码展示了如何构建图并应用Dijkstra算法找到最短路径。

摘要由CSDN通过智能技术生成

最短路径问题

如下图所示，求解从起点到终点的最短路径。

算法思路

狄克斯特拉算法包含4个步骤：
(1) 找出“最便宜”的节点，即从起点出发可在最小cost到达的节点。
(2) 更新该节点的邻居的开销，即从起点到邻居节点的cost。
(3) 重复这个过程，直到对图中的每个节点都这样做了。
(4) 计算最终路径。

代码实现


def dijkstra():

    graph = {}
    costs = {}
    parents = {}

    # graph 
    graph["start"] = {'A':5,'B':2}
    graph['A'] = {'C':4,'D':2}
    graph['B'] = {'A':8,'D':7}
    graph['C'] = {'D':6,'final':3}
    graph['D'] = {'final':1}
    graph["final"] = {}

    # costs
    infinity = float("inf")
    costs['A'] = 5
    costs['B'] = 2
    costs['C'] = infinity
    costs['D'] = infinity
    costs["final"] = infinity

    # parents
    parents['A'] = "start"
    parents['B'] = "start"
    parents['C'] = None
    parents['D'] = None
    parents["final"] = None

    # processed
    processed = []

    def find_lowest_cost_node(node:dict):
        cost = float('inf')
        res = None
        for n in node.keys():
            if not n in processed and node[n] < cost:
                cost = node[n]
                res = n
        return res
   
    node = find_lowest_cost_node(costs)
    while node:
        neighbors = graph[node]
        for k in neighbors.keys():
            cost_new = neighbors[k] + costs[node]
            if cost_new < costs[k]:
                costs[k] = cost_new
                parents[k] = node
        processed.append(node)
        node = find_lowest_cost_node(costs)

    return costs, parents