Learn Algorithm Design by Building a Shortest Path Algorithm - Step 29

Here we go again! List comprehensions. This time with dictionaries. Please help.

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 = {}
    paths = {key:[] for (key) 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 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/120.0.0.0 Safari/537.36

Challenge Information:

Learn Algorithm Design by Building a Shortest Path Algorithm - Step 29

remove () common brackets around key.

@aaronvincent6411 Thank you very much

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.