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

Tell us what’s happening:

Everything seems okay to me but the test isn’t passing

``````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[start] = 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

Then assign `0` to that node inside the `distances` dictionary.

Just double check what you are assigning to

1 Like

— solution removed by mod —

Well, I hope you get it by now. This thread already has a marked solution 4 months ago. Please don’t add solution code.

It is great that you solved the challenge, but instead of posting your full working solution, it is best to stay focused on answering the original poster’s question(s) and help guide them with hints and suggestions to solve their own issues with the challenge.

We are trying to cut back on the number of spoiler solutions found on the forum and instead focus on helping other campers with their questions and definitely not posting full working solutions.