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

### Tell us what’s happening:

Describe your issue in detail here.
step 25 says i should use the print function to print my code so far. But I have tried, but its not working.

my_graph = {
‘A’: [(‘B’, 3), (‘D’, 1)],
‘B’: [(‘A’, 3), (‘C’, 4)],
‘C’: [(‘B’, 4), (‘D’, 7)],
‘D’: [(‘A’, 1), (‘C’, 7)]
}

def shortest_path(graph, start):
unvisited =
distances = {}
for node in graph:
unvisited.append(node)
if node == start:
distances[node] = 0
else:
distances[node] = float(‘inf’)
print(f’Unvisited: {unvisited}\nDistances: {distance})

``````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
else:
distances[node] = float('inf')
print(f'Unvisited: {unvisited}\nDistances: {distances})
shortest_path(my_graph, 'A')

# User Editable Region

``````

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

### Challenge Information:

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

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.

I decide to call the shortest_path function because the first time i run the code without it, the code did not run correctly. Even when I added the shortest_path function call, nothing still happend

Hello!

It’s the additional code that throws the spell checker off and doesn’t let you pass.

Just add the print call with the f string passed. A good trick is to copy and paste strings from the challenge descriptions to avoid spelling errors.