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

Python
1

Tell us what’s happening:

I’m stuck on Step 32 of the “Learn Algorithm Design by Building a Shortest Path Algorithm” on FreeCodeCamp. It asks me to remove the for loop and all its code without adding anything else. I did exactly that, but it’s still not accepting my answer.

I’ve tried resetting the challenge, but nothing seems to work. Has anyone else faced this issue? Any ideas on how to fix it?

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/133.0.0.0 Safari/537.36

Challenge Information:

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

2

This is the starting code for this step:

def shortest_path(graph, start):
    unvisited = []
    distances = {}
    for node in graph:
        unvisited.append(node)
        if node == start:
            distances[node] = 0
        else:
            distances[node] = float('inf')
    print(f'Unvisited: {unvisited}\nDistances: {distances}')
    
shortest_path(my_graph, 'A')

You should remove the for loop and its body… this does not include the print statement, which is not part of the for loop, as it is not indented into it.

3 
def shortest_path(graph, start):
    unvisited = []
    distances = {}
shortest_path(my_graph, 'A')

I already removed the for loop and its body (print() too), but it’s still not working. Any ideas?

4

You should not remove the print statement. It is not part of the for loop.

1 Like
5

Thanks for the help! Appreciate it! :raised_hands::blush:

1 Like