我正在使用 BFS 算法,我有这段代码的输出
> for node in graph.keys():
> print(BFS(graph, node))
输出
{1: 0, 6: 1, 7: 2, 2: 3, 8: 4, 3: 5, 4: 6, 9: 7, 5: 8, 10: 9}
{2: 0, 8: 1, 3: 2, 4: 3, 9: 4, 5: 5, 10: 6, 1: -1, 6: -1, 7: -1}
{3: 0, 4: 1, 9: 2, 5: 3, 10: 4, 1: -1, 2: -1, 6: -1, 7: -1, 8: -1}
{4: 0, 9: 1, 5: 2, 10: 3, 1: -1, 2: -1, 3: -1, 6: -1, 7: -1, 8: -1}
{5: 0, 10: 1, 1: -1, 2: -1, 3: -1, 4: -1, 6: -1, 7: -1, 8: -1, 9: -1}
{6: 0, 7: 1, 2: 2, 8: 3, 3: 4, 4: 5, 9: 6, 5: 7, 10: 8, 1: -1}
{7: 0, 2: 1, 8: 2, 3: 3, 4: 4, 9: 5, 5: 6, 10: 7, 1: -1, 6: -1}
{8: 0, 3: 1, 4: 2, 9: 3, 5: 4, 10: 5, 1: -1, 2: -1, 6: -1, 7: -1}
{9: 0, 5: 1, 10: 2, 1: -1, 2: -1, 3: -1, 4: -1, 6: -1, 7: -1, 8: -1}
{10: 0, 1: -1, 2: -1, 3: -1, 4: -1, 5: -1, 6: -1, 7: -1, 8: -1, 9: -1}
我需要像这样将这些词典添加到一个词典中
dic = {
1: {1: 0, 6: 1, 7: 2, 2: 3, 8: 4, 3: 5, 4: 6, 9: 7, 5: 8, 10: 9},
2: {2: 0, 8: 1, 3: 2, 4: 3, 9: 4, 5: 5, 10: 6, 1: -1, 6: -1, 7: -1},
3: {3: 0, 4: 1, 9: 2, 5: 3, 10: 4, 1: -1, 2: -1, 6: -1, 7: -1, 8: -1},
4: {4: 0, 9: 1, 5: 2, 10: 3, 1: -1, 2: -1, 3: -1, 6: -1, 7: -1, 8: -1},
5: {5: 0, 10: 1, 1: -1, 2: -1, 3: -1, 4: -1, 6: -1, 7: -1, 8: -1, 9: -1},
6: {6: 0, 7: 1, 2: 2, 8: 3, 3: 4, 4: 5, 9: 6, 5: 7, 10: 8, 1: -1},
7: {7: 0, 2: 1, 8: 2, 3: 3, 4: 4, 9: 5, 5: 6, 10: 7, 1: -1, 6: -1},
8: {8: 0, 3: 1, 4: 2, 9: 3, 5: 4, 10: 5, 1: -1, 2: -1, 6: -1, 7: -1},
9: {9: 0, 5: 1, 10: 2, 1: -1, 2: -1, 3: -1, 4: -1, 6: -1, 7: -1, 8: -1},
10: {10: 0, 1: -1, 2: -1, 3: -1, 4: -1, 5: -1, 6: -1, 7: -1, 8: -1, 9: -1}
}
我假设创建一个空字典,并将节点添加为键,将代码的输出添加为值。但是没用
谢谢
最佳答案
只需使用字典理解:
{node:BFS(graph, node) for node in graph.keys()}
关于python - 如何将字典插入空字典?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/57856322/