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

Python
1

Tell us what’s happening:

Alright, I did exactly what it asked. Now spill the beans—what’s so hilariously wrong with this? Did I break the universe by not using a for loop? Come on, I need a good laugh!

Your code so far


# User Editable Region

my_graph = {
    'A': [('B', 3), ('D', 1)],
    'B': [('A', 3), ('C', 4)],
    'C': [('B', 4), ('D', 7)],
    'D': [('A', 1), ('C', 7)]
}

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

shortest_path(my_graph, 'A')


# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/126.0.0.0 Safari/537.36

Challenge Information:

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

2

Remove your for loop with its entire body.

Just remove the for loop and everything in it. Don’t add any other code.

3

thats what i have done, thats why im confused

4

Oh, never mind. I’ve solved it. Colour me surprised, right? It’s like watching a chimpanzee figure out a Rubik’s Cube—unexpected and mildly concerning. I mean, if i can solve it, then maybe there’s hope for humanity after all.

1 Like
5

Love to see it! Humanity wins. Keep crushing it.