Skip to main content
 首页 » 编程设计

python之获取两个节点之间的节点子图

2025年05月04日16mfryf

我有这张图:

%matplotlib inline  
import networkx as nx 
 
G = nx.Graph() 
 
G.add_edge(1, 2) 
G.add_edge(2, 3) 
G.add_edge(3, 4) 
G.add_edge(3, 5) 
G.add_edge(4, 6) 
G.add_edge(5, 6) 
G.add_edge(3, 7) 
G.add_edge(7, 6) 
G.add_edge(6, 8) 
G.add_edge(8, 9) 
 
nx.draw(G, pos=nx.spring_layout(G), with_labels=True) 

是否可以在不使用nx.subgraph(G, [3,4,5,6,7])的情况下获取节点3和6之间的子图。我的意思是,如果我知道有这个子图,但我不知道,例如关于 5?

请您参考如下方法:

我的回答和back2basics很像,但是更直接的找到了两者之间的节点。如果存在从 source 到 target 的路径,则该路径将由 nx.all_simple_paths(G, source=source, target=target) 返回路径的生成器。

import networkx as nx 
 
G = nx.Graph() 
G.add_edges_from([(1, 2), (2, 3), (3, 4), (3, 5), (4, 6), (5, 6), (3, 7), (7, 6), (6, 8), (8, 9)]) 
 
paths_between_generator = nx.all_simple_paths(G,source=3,target=6) 
nodes_between_set = {node for path in paths_between_generator for node in path} 
SG = G.subgraph(nodes_between_set) 

nodes_between_set = ... 使用“集合生成器”。相当于

nodes_between_set = set() 
for path in paths_beween_generator: 
    for node in path: 
        nodes_between_set.add(node)