Python根据已知邻接矩阵绘制无向图操作示例-创新互联
本文实例讲述了Python根据已知邻接矩阵绘制无向图操作。分享给大家供大家参考,具体如下:
创新互联是一家专注于成都做网站、成都网站制作与策划设计,通许网站建设哪家好?创新互联做网站,专注于网站建设十多年,网设计领域的专业建站公司;建站业务涵盖:通许等地区。通许做网站价格咨询:18980820575有六个点:[0,1,2,3,4,5,6],六个点之间的邻接矩阵如表格所示,根据邻接矩阵绘制出相对应的图
|
0 |
1 |
2 |
3 |
4 |
5 |
6 |
0 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
2 |
0 |
1 |
0 |
1 |
0 |
1 |
0 |
3 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
4 |
0 |
1 |
0 |
1 |
1 |
1 |
1 |
5 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
6 |
0 |
1 |
0 |
1 |
1 |
0 |
0 |
将点之间的联系构造成如下矩阵
N = [[0, 3, 5, 1],
[1, 5, 4, 3],
[2, 1, 3, 5],
[3, 5, 1, 4],
[4, 5, 1, 3],
[5, 3, 4, 1],
[6, 3, 1, 4]]
代码如下
# -*- coding:utf-8 -*- #! python3 import networkx as nx import matplotlib.pyplot as plt G=nx.Graph() point=[0,1,2,3,4,5,6] G.add_nodes_from(point) edglist=[] N = [[0, 3, 5, 1],[1, 5, 4, 3],[2, 1, 3, 5],[3, 5, 1, 4],[4, 5, 1, 3],[5, 3, 4, 1],[6, 3, 1, 4]] for i in range(7): for j in range(1,4): edglist.append((N[i][0],N[i][j])) G=nx.Graph(edglist) position = nx.circular_layout(G) nx.draw_networkx_nodes(G,position, nodelist=point, node_color="r") nx.draw_networkx_edges(G,position) nx.draw_networkx_labels(G,position) plt.show()
当前名称:Python根据已知邻接矩阵绘制无向图操作示例-创新互联
分享地址:http://hbruida.cn/article/dhjsjd.html