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

Tell us what’s happening:

i removed the for loop and didnt add any other code and its still not accepting my answer

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 = []
    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 OPR/113.0.0.0

Challenge Information:

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

All of the code in the for loop will be indented:

for this in that:
    code
    code
code

The last “code” is the same indentation level as “for” and is not in the for loop and so shouldn’t be removed. You can reset the step and try it again.

I hope this helps!