dijkstra伪码

Dijkstra算法是一种用于寻找图中两点之间最短路径的经典贪心算法。以下是Dijkstra算法的基本伪代码：

function Dijkstra(graph, start):
    distances = {}  # 初始化所有节点的距离为无穷大，除了起点为0
    visited = set()  # 存储已访问节点
    for node in graph.vertices:
        distances[node] = float('infinity')
    distances[start] = 0

    while not visited == graph.vertices:  # 当还有未访问节点时
        current_smallest_distance_node = None  # 找到距离最小的节点
        for node in graph.vertices - visited:
            if current_smallest_distance_node is None or distances[node] < distances[current_smallest_distance_node]:
                current_smallest_distance_node = node
        
        visited.add(current_smallest_distance_node)  # 标记当前节点为已访问
        for neighbor, weight in graph.edges[current_smallest_distance_node].items():  # 遍历邻居
            new_distance = distances[current_smallest_distance_node] + weight  # 更新通过邻居到达新节点的总距离
            if new_distance < distances[neighbor]:  # 如果新的距离更小，则更新
                distances[neighbor] = new_distance
    
    return distances  # 返回从起始点到每个节点的最短距离