[英]Convert BiDirectional Graph Edges to Undirected Edges in NetworkX
我正在使用NetworkX执行以下操作:我有一个有向图g ,我想将其转换为一个无向图h ,使得h具有与g相同的节点,并且e是h中的一条边,当且仅当e在g中是双向的。 例如,我想转换:
import networkx as nx
g = nx.DiGraph([("A", "B"), ("B", "A"), ("A", "C"), ("C", "A"), ("B", "C"), ("C", "B"), ("A", "D"), ("C", "D"), ("B", "E"), ("C", "E")])
进入
h = nx.Graph([("A", "B"), ("A", "C"), ("B", "C")])
h.add_nodes_from(["D", "E"])
我应该在 NetworkX 中写什么f(g) = h
? 我认为它是图形视图和过滤器的某种组合,但我是 NetworkX 的新手,所以我不确定到底是什么。
您可以通过迭代有向图的边缘并检查反向边缘是否存在条件if edge[::-1] in g.edges():
。 如果反向边缘存在,只需将其添加到您的图形中。 请参阅下面的代码:
import networkx as nx
import matplotlib.pyplot as plt
#Creating directed graph
g = nx.DiGraph([("A", "B"), ("B", "A"), ("A", "C"), ("C", "A"), ("B", "C"), ("C", "B"), ("A", "D"), ("C", "D"), ("B", "E"), ("C", "E")])
#Creating undirected graph
h=nx.Graph()
h.add_nodes_from(g)
for edge in g.edges():
if edge[::-1] in g.edges(): #check if reverse edge exist in graph
h.add_edge(edge[0],edge[1])
#plot both graphs
fig=plt.figure(figsize=(15,6))
plt.subplot(121)
plt.title('Directed graph')
pos1=nx.circular_layout(g)
nx.draw(g,pos=pos1,with_labels=True, node_color='tab:orange')
plt.subplot(122)
plt.title('Undirected graph')
pos2=nx.circular_layout(h)
nx.draw(h,pos=pos2,with_labels=True, node_color='tab:green')
output 给出:
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.