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

Python
1

Tell us what’s happening:

Hello@team please I need help on this….I’m keep stuck in the section too much

Your code so far


# User Editable Region

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

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (iPhone; CPU iPhone OS 15_7 like Mac OS X) AppleWebKit/605.1.15 (KHTML, like Gecko) CriOS/120.0.6099.119 Mobile/15E148 Safari/604.1

Challenge Information:

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

1 Like
2

You’ve added a new node, D, which is connected to A and C :white_check_mark:

but now you need to modify A and C to show connections to D.

It wasn’t entirely clear but that’s what it meant by "Modify your dictionary to represent this structure. "

4 Likes
3

Debes Modificar las lista ‘A’ y ‘C’, para que todas tengan coneccion ‘A’ con ‘B’ y ‘D’ , ‘C’ con ‘B’ y ‘D’.

5

Hola Gracias por ayudar, pero no es necesario responder a hilos que se resolvieron hace meses, ¡gracias!