我是在节点a和b之间遍历的dfs,但是当我在节点b处断开循环时,算法继续.这是我的代码:
import networkx as nx
def Graph():
G=nx.Graph()
k = 30
G.add_edge(1,2)
G.add_edge(2,3)
G.add_edge(1,3)
for i in range(2,k+1):
G.add_edge(2*i-2,2*i)
G.add_edge(2*i-1,2*i)
G.add_edge(2*i-1,2*i+1)
G.add_edge(2*i,2*i+1)
G.add_nodes_from(G.nodes(), color='never coloured')
G.add_nodes_from(G.nodes(), label = -1)
G.add_nodes_from(G.nodes(), visited = 'no')
return G
def dfs(G,a,b,u):
global i
G.node[u]['visited'] = 'yes'
i += 1
G.node[u]['label'] = i
print(u)
print("i", i)
for v in G.neighbors(u):
if v == b:
G.node[v]['visited'] = 'yes'
i +=