kal*_*mbo 6 python tree graph networkx
import networkx as nx
G = nx.Graph()
G.add_edge(1,2)
G.add_edge(2,3)
G.add_edge(3,5)
G.add_edge(4,6)
G.add_edge(1,6)
G.add_edge(2,6)
G.add_edge(7,8)
G.add_edge(9,8)
mst=nx.prim_mst(G)# a generator of MST edges
Run Code Online (Sandbox Code Playgroud)
我有一棵树.如何在4处获得带有root的定向树?
要从节点4获取广度优先搜索的有向树:
tree = nx.bfs_tree(G, 4)
Run Code Online (Sandbox Code Playgroud)
要从节点4获取depfth-first搜索的有向树:
tree = nx.dfs_tree(G, 4)
Run Code Online (Sandbox Code Playgroud)
图表是这样生成的:
import matplotlib.pyplot as plt
import networkx as nx
G = nx.Graph()
G.add_edge(1,2)
G.add_edge(2,3)
G.add_edge(3,5)
G.add_edge(4,6)
G.add_edge(1,6)
G.add_edge(2,6)
G.add_edge(7,8)
G.add_edge(9,8)
tree = nx.bfs_tree(G, 4)
nx.draw(tree)
plt.savefig('/tmp/bfs_image.png')
Run Code Online (Sandbox Code Playgroud)