如何将加权边列表转化为r中的邻接矩阵

# 加权边列表
weighted_edges <- list(
  c("A", "B", 2),
  c("B", "C", 3),
  c("C", "A", 1)
)

# 获取节点列表
nodes <- unique(unlist(weighted_edges[1:2]))

# 创建空的邻接矩阵
adj_matrix <- matrix(0, nrow = length(nodes), ncol = length(nodes), dimnames = list(nodes, nodes))

# 转化加权边列表为邻接矩阵
for (edge in weighted_edges) {
  start_node <- edge[1]
  end_node <- edge[2]
  weight <- edge[3]
  
  adj_matrix[start_node, end_node] <- weight
  
  # 如果是无向图，同时设置目标节点到起始节点的权重值
  adj_matrix[end_node, start_node] <- weight
}

# 打印邻接矩阵
print(adj_matrix)