Question

给出一个地图，用逗号分隔的一串双位数字表示，例如“12,23,34,45,56,67,78,81”，其中每对数字代表两位数之间的路径，转换将字符串转换为由字典表示的图形，其中键作为原点（数字），值作为键中的可用目标。例如1：[2,8]，2 [3]等这是我非常难看的尝试：

def path(way):
x = way.split(',')
y = sorted(set(tele.replace(',','')))
graph = dict()
for i in x:
    for j in range(len(i)):
        for h in y:
            if h in i and i[j] != h:
                if h in graph:
                    graph[h].append((i[j]))
                else:
                    graph[h] = [(i[j])]
return graph

我打算在此之后实现广度优先搜索算法，以便找到最佳路径。如果我的解释不清楚，我很抱歉。非常感谢任何帮助，谢谢！

Answer 1

# this initializes values in the dictionary d with empty lists
# so that we can directly call .append() without checking "if key in keys"
from collections import defaultdict
d = defaultdict(list)

# your input string
s = "12,23,34,45,56,67,78,81"

# iterate through digit pairs
for pair in s.split(","):
  # get single digits from a pair
  fr = pair[0]
  to = pair[1]

  # add edges in both directions (undirected)
  d[fr].append(to)
  d[to].append(fr)

# see what we got
print d

结果

{'1': ['2', '8'], '3': ['2', '4'], '2': ['1', '3'], '5': ['4', '6'], '4': ['3', '5'], '7': ['6', '8'], '6': ['5', '7'], '8': ['7', '1']}

将由键值对字符串表示的图形转换为字典。蟒蛇

1 个答案: