### 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.

### 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)]

}

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
```

### Your browser information:

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