我正在尝试找到每个节点与起始节点之间的距离,节点之间的连接关系以字典形式给出。
我的代码可以很好地处理像这个例子这样的小字典,但是在节点数超过20个的字典上会出现错误。
if child != parent and child not in my_list:
RecursionError: maximum recursion depth exceeded in comparison
我卡在这里了,有人能帮我吗?
![在此输入图片描述](https://istack.dev59.com/xd0Tm.webp)
def compute_distance(node, dic, node_distance, count, parent, my_list):
children = dic[node]
node_distance[node].append(count)
for child in children:
if child != parent and child not in my_list:
compute_distance(child, dic, node_distance, count + 1, node, children)
node_distance_dic = {}
node_distance_dic = {k: min(v) for k, v in node_distance.items()}
return node_distance_dic
if __name__ == '__main__':
starting_node = 9
dic = {0: [1, 3], 1: [0, 3, 4], 2: [3, 5],
3: [0, 1, 2, 4, 5, 6], 4: [1, 3, 6, 7],
5: [2, 3, 6], 6: [3, 4, 5, 7, 8],
7: [4, 6, 8, 9], 8: [6, 7, 9], 9: [7, 8]}
print(compute_distance(starting_node, dic, defaultdict(list), 0, 0, []))
输出(键=key,值=value)为节点和距离。
{0: 4, 1: 3, 2: 4, 3: 3, 4: 2, 5: 3, 6: 2, 7: 1, 8: 1, 9: 0}