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

Python
1

Tell us what’s happening:

Describe your issue in detail here.

Your code so far


# User Editable Region

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

# 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

Hi, welcome to the forum!
We see you have posted some code but did you have a question?

(You have not filled out the “Tell us what’s happening:” field above)

4

Hello!
The distance is should be using in the second tuple within the ‘A’ key is from A-D, not from C-D. Hope this helps!

5

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