I do not understand this question. To me neighbor node is undefined 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 = list(graph) di…

I just looked at my question and to my untrained eye this is like an infinite loop or a merry go round type of question.

[image] zack3: distances(node) = distance + distances(current) instead of () common brackets use [] square brackets.

@aaronvincent6411 thanks for your suggestion. I remove the (common brackets)/parenthesis and put the square brackets instead and my code has not yet passed. What else can we do?

Okay. But how do I do that? I tried editing it here on the forum page but when I try to save it throws an error. What is the best way of updating my code?

[image] Learn How to Work with Numbers and Strings by Implementing the Luhn Algorithm - Step 31 Python When you enter a code block into a forum post, please precede it with a separate line of three backticks and follow it with a separate line of three backticks to make it …

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 = list(graph) distances = {node: 0 if node == start else float('inf') for node in graph} paths = {node: []…

Hello Zack [image] zack3: distance[node] [image] zack3: distance[current] You are forgetting the s. You need to get it out of distances. Just like in your if statement. distance without the s is the literal distance integer from your graph.

Hi @HungryBee , thanks. I think one of the things baffling me is the neighbor node. Its like I don’t seem to understand the whole question anymore because it has stretched for so long. To get back to a level where I understand the whole question I think I might have to start all over again. A pity …

It makes sense, it may also help to just take a small break and re-read the current code again and try to tell yourself what every specific part is doing so far. You’ve already gotten far though, once you start to understand it you’ll only go further!

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

Curriculum Help

aaronvincent6411 January 9, 2024, 12:51pm 7

In this post u will see how to share updated code

Topic		Replies	Views	Activity
Learn Algorithm Design by Building a Shortest Path Algorithm - Step 47 español	4	279	April 30, 2024

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

Related topics