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

### Tell us what’s happening:

Describe your issue in detail here.
Hi team. Please assist with this step. Here is my code:

``````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:
node = 0

/* User Editable Region */

``````

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

### Challenge Information:

Learn Algorithm Design by Building a Shortest Path Algorithm - Step 23
https://www.freecodecamp.org/learn/scientific-computing-with-python/learn-algorithm-design-by-building-a-shortest-path-algorithm/step-23`Preformatted text`

You appear to have created this post without editing the template. Please edit your post to Tell us what’s happening in your own words.

Hello Brice,

Right now you are assigning `node` to `0`, but you’re missing the part of the question where it says: inside the `distances` dictionary.

So you just need to adjust it so it changes the node, inside the `distances` dictionary, to 0 instead of just the `node`.

1 Like