使用列表迭代邻接矩阵

# 定义一个无向图的邻接矩阵
adj_matrix = [
    [0, 1, 1, 0],
    [1, 0, 1, 0],
    [1, 1, 0, 1],
    [0, 0, 1, 0]
]

# 获取图的顶点数
num_vertices = len(adj_matrix)

# 迭代邻接矩阵
for i in range(num_vertices):
    for j in range(i, num_vertices):  # 只需迭代到 i，避免重复
        if adj_matrix[i][j] == 1:
            print(f"顶点 {i} 和顶点 {j} 之间有边")

# 定义一个无向图的邻接表
adj_list = {
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3],
    3: [2]
}

# 迭代邻接表
for vertex, neighbors in adj_list.items():
    for neighbor in neighbors:
        print(f"顶点 {vertex} 和顶点 {neighbor} 之间有边")