python计算邻接矩阵的实现示例

size = 5  # 矩阵的大小
adj_matrix = [[0] * size for _ in range(size)]  # 创建一个大小为size的二维数组

# 设置节点之间的连接关系
adj_matrix[0][1] = 1
adj_matrix[1][0] = 1
adj_matrix[1][2] = 1
adj_matrix[2][1] = 1
adj_matrix[2][3] = 1
adj_matrix[3][2] = 1
adj_matrix[3][4] = 1
adj_matrix[4][3] = 1

# 打印邻接矩阵
for row in adj_matrix:
    print(row)

import numpy as np

# 邻接矩阵
adj_matrix = np.array([[0, 1, 0, 0, 0],
                       [1, 0, 1, 0, 0],
                       [0, 1, 0, 1, 0],
                       [0, 0, 1, 0, 1],
                       [0, 0, 0, 1, 0]])

# 计算最短路径
dist_matrix = np.copy(adj_matrix)
for k in range(len(adj_matrix)):
    for i in range(len(adj_matrix)):
        for j in range(len(adj_matrix)):
            if dist_matrix[i][j] > dist_matrix[i][k] + dist_matrix[k][j]:
                dist_matrix[i][j] = dist_matrix[i][k] + dist_matrix[k][j]

# 打印最短路径矩阵
for row in dist_matrix:
    print(row)