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

### Tell us what’s happening:

Describe your issue in detail here.
This is the 2nd comprehension task (other one was regex with password generator 64) I’ve found on this beta that I’ve been completely unable to complete even tho I’m pretty sure my syntax is right. The error message returned to me is that I need a paths variable, which if you look at my code doesn’t make sense. Can someone help me?

### 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 = {}
paths = {key:[] for (key, value) in graph.items}

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/120.0.0.0 Safari/537.36`

### Challenge Information:

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

Two problems here

1. You only need the keys
2. You should be drawing from the graph, not any specific property of the graph
2 Likes

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.