擅长:python、mysql、java
<p>下面是一个递归DFS过程,用于跟踪每个分支的路径:</p>
<pre><code>dict_of_dicts = {'a': {'b': {'c': {}, 'd': {}, 'e': {}}}, 'f': {'g': {}}}
def dfs(path, d):
if d == {}:
print path;
for item in d:
dfs(path+[item],d[item])
dfs([],dict_of_dicts)
</code></pre>
<p>输出:</p>
<pre><code>['a', 'b', 'c']
['a', 'b', 'e']
['a', 'b', 'd']
['f', 'g']
</code></pre>