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

Python
1

Tell us what’s happening:

Help I’m stuck on this step.
I can’t seem to pass this step.

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 = graph
    distances = {}
    
    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/127.0.0.0 Safari/537.36

Challenge Information:

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

2

Welcome to our community!

The instructions: “… Modify the assignment of your unvisited variable to use list() , and pass graph as the iterable.”

Assign list() to the variable in question and then pass ‘graph’ to it (put it between parentheses).