Python贪心法写Dijkstra算法

```python

import heapq

 

def dijkstra(graph, start):

    # 初始化距离字典，将所有节点的距离设为无穷大，起始节点的距离设为0

    distances = {node: float('infinity') for node in graph}

    distances[start] = 0

 

    # 创建一个优先队列，用于存储待处理的节点及其距离

    priority_queue = [(0, start)]

 

    while priority_queue:

        # 从优先队列中取出距离最短的节点

        current_distance, current_node = heapq.heappop(priority_queue)

 

        # 如果当前节点的距离已经被更新过，跳过

        if current_distance > distances[current_node]:

            continue

 

        # 遍历当前节点的邻居节点

        for neighbor, weight in graph[current_node].items():

            # 计算从当前节点到邻居节点的距离

            distance = current_distance + weight

 

            # 如果新计算的距离小于已知距离，更新距离并将邻居节点加入优先队列

            if distance < distances[neighbor]:

                distances[neighbor] = distance

                heapq.heappush(priority_queue, (distance, neighbor))

 

    return distances

 

# 示例图

graph = {

    'A': {'B': 1, 'C': 4},

    'B': {'A': 1, 'C': 2, 'D': 5},

    'C': {'A': 4, 'B': 2, 'D': 1},

    'D': {'B': 5, 'C': 1}

}

 

print(dijkstra(graph, 'A'))

```

 

这段代码是用Python实现的Dijkstra算法，利用贪心法求解最短路径。