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

### Tell us what’s happening:

def shortest_path(graph, start):
unvisited = list(graph)
distances = { node: node == 0 if node == start else node == float(‘inf’) for node in graph}
paths = {node: for node in graph}
print(f’Unvisited: {unvisited}\nDistances: {distances}')
shortest_path(my_graph, ‘A’)

It keeps saying: You should use the dictionary comprehension syntax to give a value to your distances variable.

I do not see the error… Thank you

### 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: node == 0 if node == start else node == 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 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/125.0.0.0 Safari/537.36`

### Challenge Information:

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

look at the output
`Distances: {'A': False, 'B': False, 'C': False, 'D': False}`

is False the value you expect?

No it is not. it should return a string. Bu I already figured it out. I was not doing the dictionary comprehension syntax correctly. Thank you.