# Learn Algorithm Design by Building a Shortest Path Algorithm - Step 14

### Tell us what’s happening:

Not sure what the error is. Instructions are as follows. Add one last node, `D` , which is connected with `A` and `C` . Modify your dictionary to represent this structure. Again, use a list to represent multiple connections.

``````
/* User Editable Region */

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

/* User Editable Region */

``````

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 14

1 Like

You have a new node, D, which is connected to A and C.

When you added C, you needed to modify B to show it’s now connected to C as well.

D is connected to A and C. That means A is connected to B and D.

and C is connected to B and D.

1 Like

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