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

Python
1

Tell us what’s happening:

Describe your issue in detail here. I don’t know how to do this, I could really use some help. Please!

Your code so far


# User Editable Region

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

# 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/120.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 @carrie

You need to create tuples.
The first part for each will be the edge (which you coded), and the second part will be the weight.

Happy coding

4

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