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

Tell us what’s happening:

I’m not sure what the issue is. I get the error: You should remove your for loop and all the nested code. I did remove the for loop and the nested code? Not sure what to fix. 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 = []
    distances = {}

/* 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 27

Hi @lmoh3479 ,

You’re on the right track - you’ve been asked to remove the for loop which you’ve done. Perhaps you’ve removed a little too much - your loop ends after the else statement.

2 Likes

I didn’t even realize! Thank you so much!

2 Likes