简单图论最短路径

Dijkstra

from typing import *
import numpy as np
def floyd(matrix:List[List[int]]) -> None:
    
    length = len(matrix)
    
    path = [[-1]*length for _ in range(length)]
    
    for k in range(length):
        for i in range(length):
            for j in range(length):
                if matrix[i][j] > matrix[i][k] + matrix[k][j]:
                    matrix[i][j] = matrix[i][k] + matrix[k][j]
                    path[i][j] = k+1
    
    print(np.array(matrix))
    print(np.array(path))

matrix = [[0,9,float("inf"),1],
          [9,0,3,float("inf")],
          [float("inf"),3,0,2],
          [1,float("inf"),2,0]]
floyd(matrix)
    

floyd

from typing import *
import numpy as np
def Dijkstra(matrix:List[List[int]]) -> None:
    length = len(matrix)
    dis = [a for a in matrix[0]]
    v = [1]*length
    v[0] = 0
    for i in range(length):
        minValue=float("inf")
        k = 0
        for j in range(length):
            if v[j] and dis[j] < minValue:
                minValue = dis[j]
                k = j
        
        v[k] = 0
        for z in range(length):
            if  v[z] and dis[z] > minValue + matrix[k][z]:
                dis[z] = minValue + matrix[k][z]
    
    print(dis)
matrix = [[0,9,float("inf"),1],
          [9,0,3,float("inf")],
          [float("inf"),3,0,2],
          [1,float("inf"),2,0]]
Dijkstra(matrix)