# Learn Algorithm Design by Building a Shortest Path Algorithm - Step 30

### Tell us what’s happening:

Can someone help me to solve this problem.

They ask me to use dictonary comprehension and assign it to distances, but when I do that, I got this ‘’ You should use the dictionary comprehension syntax to give a value to your `distances` variable.‘’

``````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 start == node 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 */

``````

User Agent is: `Mozilla/5.0 (X11; Linux x86_64) 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 30

This test is a bit too strict. Swapping the condition to `node == start` will make it pass.

Would you be interested in making issue for this on github? Sign in to GitHub · GitHub

Hello kat,

Your logic is fine, try and swap `node` and `start` in your if statement.

Thank you it works perfectly

Got it! Thank you sanity

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.