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

Tell us what’s happening:

hi, who can help with this step? I don’t understand. Thanks!

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 = []
    for node in range(graph):
        unvisited.append(node)

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

Challenge Information:

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

graph is a dictionary. You cannot pass a dictionary to range(). How do you iterate over a dictionary?

so, how to pass this step? can anyone help, please?

Dario is trying to help you… why don’t you try to answer his question?

1 Like