hey guys! im stuck here:
Step 30
Dictionary comprehensions support conditional if
/else
syntax too:
{key: val_1 if condition else val_2 for key in dict}
Use a dictionary comprehension to create a dictionary based in graph
and assign it to the distances
variable. Give the key a value of zero if the node is equal to the starting node, and infinite otherwise. Use float('inf')
to achieve the latter.
as i see it i assigned everything right, cant be an indention problem if its in one line right? please help me finding my brain fart…
Your code so far
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==0: if node==start else:node=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
Your browser information:
User Agent is: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/122.0.0.0 Safari/537.36
Challenge Information:
Learn Algorithm Design by Building a Shortest Path Algorithm - Step 30