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

Python
1

Tell us what’s happening:

I have checked it in the similar question forum but not able to understand where i am going wrong can someone help me in this?

Your code so far


# User Editable Region

my_graph = {
    'A': 'B',
    'B': ['A','C'],
    'B': 'C',
    'C': 'B'
}
my_graph['B']

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/136.0.0.0 Safari/537.36

Challenge Information:

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

2

Hi. A lot of these tests are working out what the instructions are telling you to do.

With B the instructions say:

change the value of the existing 'B' key into the list ['A', 'C']

What have you done with this instruction? What change do you think you need to make for it to pass?

3

nothing i have simply followed the steps he told me to perform and not sure why the code is not getting me through it?

4

I can see you have done 2 things with that last instruction for B. Can you explain in your own words what the instruction asked you to do and then what you did and see what the difference might be? It might help you work out where the issue is.

5

do you know the difference between “add” and “change”?

you are not being timed to do these steps, give yourself more time, take the time to read and understand, do not rush

1 Like
6

oh i got it i repeated the B dictornary twice and when i removed one of it it got passed thanks for the help.