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

Python
1

Tell us what’s happening:

I just don’t understand the excercise explanation, what does it mean ‘list of tuples?’ Am I on the right track here?

Your code so far


# User Editable Region

my_graph = {
    'A': [('A-B', 3), ('A-D', 1)],

# User Editable Region

    'B': ['A', 'C'],
    'C': ['B', 'D'],
    'D': ['A', 'C']
}

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 15

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

Welcome to the forum @SonicJohn

Your code is using the edge instead of the connected node.

Happy coding

1 Like
4

20 mins of thinking, writing and deleting :rofl::rofl::sob::sob:, this really helped me to notice thank you.

1 Like
5

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