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

### Tell us what’s happening:

I think the wording is slightly off but I cannot figure out how to add the keypair to the dictionary

``````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 = {}
for node in graph:
unvisited.append(node)
if node == start:
distances[node == 0]

# User Editable Region

``````

User Agent is: `Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/127.0.0.0 Safari/537.36`

### Challenge Information:

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

Hi @Abbsclark!

Double-check your `distances[node == 0]` line.

Recall that the assignment operator is `=`. The comparison operator is `==`.

To assign the value in a case like this, you’re looking for a pattern similar to:

``````my_dictionary[x] = 33
``````

I hope this helps. Happy Coding!