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

Python
1

Tell us what’s happening:

Describe your issue in detail here. im not sure how to do what im asked. i could only think of three ways: unvisited = [list(graph)] / unvisited.append(list(graph)) / print(f’Unvisited: {list(graph)}\nDistances: {distances}')

im not seeing what else i could try here. please hints

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 = []
    distances = {}
    
    print(f'Unvisited: {list(graph)}\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; rv:122.0) Gecko/20100101 Firefox/122.0

Challenge Information:

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

2

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.

3

Hi @barbir

You have not updated the required variable.

Happy coding

4

im still not sure what am i supposed to do there, i did try unvisited = [list(graph)] but its not working

5 
[ ]

Square brackets also make a list so you’re making a list of a list.

6

The instructions did not ask you to modify the print call.

Please reset the step to restore the original code.

Then replace whatever is currently assigned to unvisited with what the instructions are asking.

Happy coding

7

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