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

Python
1

Tell us what’s happening:

Had an error in path variable
Your paths variable should use the dictionary comprehension syntax to assign an empty list to each node in graph.

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/122.0.0.0 Safari/537.36 Edg/122.0.0.0

Challenge Information:

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

2

Hello!

The ‘key’ in the example is just a placeholder.

What are the keys called in this exercise? Hint: We are connecting them and trying to find shortest distance between them.

Also don’t put the second key in parentheses.

3

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