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

Tell us what’s happening:

Describe your issue in detail here.

Your code so far


# User Editable Region

my_graph = {
    'A': ['3', '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/123.0.0.0 Safari/537.36

Challenge Information:

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

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.
Learning to describe problems is hard, but it is an important part of learning how to code.
Also, the more you say, the more we can help!

how it is work i dont understand

my_graph = {
‘A’: [‘3’, ‘1’],
it is uncorrect

You were given this original piece:

my_graph = {
    'A': ['B', 'D'],

Don’t remove value ‘B’ or ‘D’, just make them a tuple (.., ...) , using those values and the other values in the table given.

Edge 	Weight
A-B 	3
B-C 	4
C-D 	7
D-A 	1

show me one example, I can’t do it

Do you remember what a tuple is from previous Steps?

You need to turn those 2 strings 'B' and 'D' into 2 tuples.

– solution removed by mod —

It is great that you solved the challenge, but instead of posting your full working solution, it is best to stay focused on answering the original poster’s question(s) and help guide them with hints and suggestions to solve their own issues with the challenge.

We are trying to cut back on the number of spoiler solutions found on the forum and instead focus on helping other campers with their questions and definitely not posting full working solutions.