擅长:python、mysql、java
<p>谢谢大家,问题解决了。我需要编写的函数如下。在</p>
<pre><code>def trace_graph(k, graph):
""" takes a graph and returns a list of lists showing all possible routes from k """
paths = [[k,v] for v in graph[k]]
for path in paths:
xs = path[:-1]
x = path[-1]
for v in graph[x]:
if v not in xs and path + [v] not in paths:
paths.append(path + [v])
paths.sort()
return paths
for path in trace_graph('A', make_graph(nodes)):
print(path)
['A', 'B']
['A', 'B', 'C']
['A', 'B', 'C', 'D']
['A', 'B', 'C', 'E']
['A', 'B', 'C', 'F']
['A', 'B', 'E']
['A', 'B', 'E', 'C']
['A', 'B', 'E', 'C', 'D']
['A', 'B', 'E', 'C', 'F']
</code></pre>