代码随想录算法训练营第五十九天｜dijkstra（堆优化版）精讲 、Bellman_ford 算法精讲

dijkstra（堆优化版）

卡码网：47. 参加科学大会

import heapq

class Edge:
    def __init__(self, to, val):
        self.to = to
        self.val = val

def dijkstra(n, m, edges, start, end):
    grid = [[] for _ in range(n + 1)]

    for p1, p2, val in edges:
        grid[p1].append(Edge(p2, val))

    minDist = [float('inf')] * (n + 1)
    visited = [False] * (n + 1)

    pq = []
    heapq.heappush(pq, (0, start))
    minDist[start] = 0

    while pq:
        cur_dist, cur_node = heapq.heappop(pq)

        if visited[cur_node]:
            continue

        visited[cur_node] = True

        for edge in grid[cur_node]:
            if not visited[edge.to] and cur_dist + edge.val < minDist[edge.to]:
                minDist[edge.to] = cur_dist + edge.val
                heapq.heappush(pq, (minDist[edge.to], edge.to))

    return -1 if minDist[end] == float('inf') else minDist[end]

# 输入
n, m = map(int, input().split())
edges = [tuple(map(int, input().split())) for _ in range(m)]
start = 1  # 起点
end = n    # 终点

# 运行算法并输出结果
result = dijkstra(n, m, edges, start, end)
print(result)

Bellman_ford 算法

卡码网：94. 城市间货物运输 I

def main():
    n, m = map(int, input().split())
    # 将所有边保存起来
    edges = []
    for _ in range(m):
        p1, p2, val = map(int, input().split())
        # p1 指向 p2，权值为 val
        edges.append((p1, p2, val))

    start = 1  # 起点
    end = n    # 终点

    # 初始化最短距离数组，所有值为无穷大
    min_dist = [float('inf')] * (n + 1)
    min_dist[start] = 0

    # 对所有边松弛 n-1 次
    for _ in range(n - 1):
        # 每一次松弛，都是对所有边进行松弛
        for from_, to_, price in edges:
            # 松弛操作
            # 确保 from_ 已计算过，避免从未计算过的节点出发
            if min_dist[from_] != float('inf') and min_dist[to_] > min_dist[from_] + price:
                min_dist[to_] = min_dist[from_] + price

    # 检查是否能够到达终点
    if min_dist[end] == float('inf'):
        print("unconnected")
    else:
        print(min_dist[end])  # 打印到达终点的最短路径长度

if __name__ == "__main__":
    main()