python: 检测到 networkX 中的循环

python: detecting a cycle in networkX

正如标题所暗示的,我正在尝试编写一个函数来计算任何输入节点所属的周期数。我找到了一个很有帮助的 video,它解释了寻找循环的算法背后的理论,但我无法理解如何使用 networkX 而不是该站点正在使用的数据结构来实现它。我无法理解 white/grey/etc 集合概念以及遍历网络和查找循环。

我的函数parameters/structure:

def feedback_loop_counter(G, node):
    c = 0
    calculate all cycles in the network
    for every cycle node is in, increment c by 1
    return c

网络也有输入和输出节点,我不清楚它们如何影响计算周期

这是我的输入网络:

import networkx as nx
import matplotlib.pyplot as plt
G=nx.DiGraph()
molecules = ["CD40L", "CD40", "NF-kB", "XBP1", "Pax5", "Bach2", "Irf4", "IL-4", "IL-4R", "STAT6", "AID", "Blimp1", "Bcl6", "ERK", "BCR", "STAT3", "Ag", "STAT5", "IL-21R", "IL-21", "IL-2", "IL-2R"]
Bcl6 = [("Bcl6", "Bcl6"), ("Bcl6", "Blimp1"), ("Bcl6", "Irf4")]
STAT5 = [("STAT5", "Bcl6")]
IL_2R = [("IL-2R", "STAT5")]
IL_2 = [("IL-22", "IL-2R")]
BCR = [("BCR", "ERK")]
Ag = [("Ag", "BCR")]
CD40L = [("CD40L", "CD40")]
CD40 = [("CD40", "NF-B")]
NF_B = [("NF-B", "Irf4"), ("NF-B", "AID")]
Irf4 = [("Irf4", "Bcl6"), ("Irf4", "Pax5"), ("Irf4", "Irf4"), ("Irf4", "Blimp1")]
ERK = [("ERK", "Bcl6"), ("ERK", "Blimp1"), ("ERK", "Pax5")]
STAT3 = [("STAT3", "Blimp1")]
IL_21 = [("IL-21", "IL-21R")]
IL_21R = [("IL-21R", "STAT3")]
IL_4R = [("IL-4R", "STAT6")]
STAT6 = [("STAT6", "AID"), ("STAT6", "Bcl6")]
Bach2 = [("Bach2", "Blimp1")]
IL_4 = [("IL-4", "IL-4R")]
Blimp1 = [("Blimp1", "Bcl6"), ("Blimp1", "Bach2"), ("Blimp1", "Pax5"), ("Blimp1", "AID"), ("Blimp1", "Irf4")]
Pax5 = [("Pax5", "Pax5"), ("Pax5", "AID"), ("Pax5", "Bcl6"), ("Pax5", "Bach2"), ("Pax5", "XBP1"), ("Pax5", "ERK"), ("Pax5", "Blimp1")]
edges = Bcl6 + STAT5 + IL_2R + IL_2 + BCR + Ag + CD40L + CD40 + NF_B + Irf4 + 
ERK + STAT3 + IL_21 + IL_21R + IL_4R + STAT6 + Bach2 + IL_4 + Blimp1 + Pax5
G.add_nodes_from(molecules)
G.add_edges_from(edges)
sources = ["Ag", "CD40L", "IL-2", "IL-21", "IL-4"]
targets = ["XBP1", "AID"]

找到循环的想法是做一个 Depth-first search,当你这样做的时候,记住你已经看到了哪些节点以及到它们的路径。如果你碰巧访问了一个你已经看过的节点,那么就有一个循环,你可以通过连接路径找到它。

尝试编写一些代码来执行此操作,如果遇到困难,请使用该代码提出一个新问题

我将假设您对 "simple cycles" 感兴趣,即唯一重复节点是 first/last 节点的循环。

将那些有边的节点取到节点u("input nodes")。然后使用 networkx 命令 all_simple_paths 查找从 u 到每个输入节点的所有简单路径。每一个都成为一个简单的循环。