Cuéntanos qué está pasando:
Because it happens to me here, that the console gives me True, the exercise does not pass, and it gives me this error message:
You should use the dictionary comprehension syntax to give a value to your distances variable.
Tu código hasta el momento
my_graph = {
'A': [('B', 3), ('D', 1)],
'B': [('A', 3), ('C', 4)],
'C': [('B', 4), ('D', 7)],
'D': [('A', 1), ('C', 7)]
}
# User Editable Region
def shortest_path(graph, start):
unvisited = list(graph)
distances = {node: node == node if start else float('inf') for node in graph}
paths = {node: [] for node in graph}
print(f'Unvisited: {unvisited}\nDistances: {distances}')
shortest_path(my_graph, 'A')
# User Editable Region
Información de tu navegador:
El agente de usuario es: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/128.0.0.0 Safari/537.36
Información del Desafío:
Aprende Diseño de Algoritmo Construyendo un Algoritmo de la Ruta más Corta - Step 35