python break怎么用_如何在Python中不使用return或break来中断函数

我在节点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 += 1

G.node[v]['label'] = i

print("b is ", v)

print("distance from a to b is ", G.node[v]['label'])

break### the problem area, doesn't break out the function

elif v != b:

if G.node[v]['visited'] == 'no':

dfs(G,a,b,v)

G=Graph()

a=1

b=19

i = 0

print('Depth-First-Search visited the following nodes of G in this order:')

dfs(G,a,b,a) ### count the DFS-path from a to b, starting at a

print('Depth-First Search found in G7 a path between vertices', a, 'and', b, 'of length:', G7.node[b]['label'])

print()

我尝试过从for循环中返回，尝试使用break和try/catch方法。有没有什么好方法可以打破这个函数，或者我必须重写它，因为它不会在u的所有邻域中递归？在