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

Python
1

Tell us what’s happening:

I was asked to use a dictionary comprehension syntax to give a value to the distances variable. I have done that but my code didn’t pass

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 = list(graph)
    distances = {node: 0 if node == 0 else float('inf') for node in graph}
    paths = {node: [] for node in graph}
    print(f'Unvisited: {unvisited}\nDistances: {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/130.0.0.0 Safari/537.36

Challenge Information:

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

2

Give the key a value of zero if the node is equal to the starting node

You’ll need to revisit this instruction.

1 Like
3

okay, I will do just that

4

I figured it out, I added start to my if condition and it passed. thank you

1 Like