图论中最短路径问题

1.dijkstra算法

# 请在此输入您的代码
#优先队列来做，每次出最小的点
from queue import  PriorityQueue
INF = 1e18
def dj(s):
    #d数组表示每个点到s的最短距离
    d = [INF]*(n+1)
    #vis表示其是否已经被更新到最短路径
    #其第一次出队列可判断其也被更新到到最短路径
    vis = [0]*(n+1)
    pq = PriorityQueue()
    d[s] = 0
    pq.put((d[s],s))#起点放入队列
    while not pq.empty():
        dis,u = pq.get()
        if vis[u] :
            continue
        vis[u] = 1
        for v,w in G[u]:
            if d[v] > d[u] + w:
                d[v] = d[u] + w
                pq.put((d[v],v))
    for i in range(1,n+1):
        if d[i] == INF :
            d[i] = -1

    return d[1::]



n,m = map(int,input().split())
G = [[] for i in range(n+1)]
for i in range(m):
    u,v,w = map(int,input().split())
    G[u].append([v,w])
    
print(*dj(1),sep = " ")

2.Floyd算法

INF = 1e18
n,m,q = map(int,input().split())
#邻接矩阵来存图
#DP表示点到点的最小距离 dp数组其既是邻接矩阵又是优化算法
dp = [[INF]*(n+1) for i in range(n+1)]
for i in range(n+1):
    dp[i][i] = 0
for i in range(m):
    u,v,w =map(int,input().split())
    dp[u][v] = dp[v][u] = min(dp[u][v],w)# 去重边
#Floyd算法
for k in range(1,n+1):
    for i in range(1,n+1):
        for j in range(1,n+1):
            dp[i][j] = min(dp[i][j],dp[i][k]+ dp[k][j])


for i in range(q):
    s,e = map(int,input().split())
    if dp[s][e] == INF:
        print(-1)
    else:
        print(dp[s][e])

3.Bellman-ford

n,m = map(int,input().split())
c = [0] + list(map(int,input().split()))
#存边 枚举边
e = []
for i in range(m):
    u,v,w = map(int,input().split())
    e.append([u,v,w])
    e.append([v,u,w])
#表示起点到该点的INF最短距离
INF = 1e9
d = [INF]*(n+1)
d[1] = 0
for i in range(n-1):
    for u,v,w in e:
        if d[v] > d[u] +w:
            d[v] = d[u] +w 
print(d[n])