擅长:python、mysql、java
<p>因为您只想获取从头到尾的所有路径,所以当路径到达末尾时,会将路径附加到总路径列表中。不返回路径的总列表,而是填充:</p>
<pre><code>paths = []
def myDFS(graph,start,end,path=[]):
path=path+[start]
if start==end:
paths.append(path)
for node in graph.childrenOf(start):
if node not in path:
myDFS(graph,node,end,path)
</code></pre>