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

Tell us what’s happening:

Can anyone help with this one? thanks so much! I got stuck!

Your code so far

my_graph = {
    'A': [('B', 3), ('D', 1)],
    'B': [('A', 3), ('C', 4)],
    'C': [('B', 4), ('D', 7)],
    'D': [('A', 1), ('C', 7)]
}


# User Editable Region

def shortest_path(graph, start):
    unvisited = []
    distances = {}
    for node in graph:
        unvisited.append(node)
        if node == start:
            node = 0
            distances = {'node'}

# 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/125.0.0.0 Safari/537.36 Edg/125.0.0.0

Challenge Information:

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

Welcome to the forum @Yuxiao

Inside your new if statement you should assign 0 to the node in the distances dictionary.

Your code needs to be on one line.

Happy coding

distances is a dictionary and node is a variable that represents a key in the dictionary.

Access the node key in the distances dictionary and assign it to 0. Don’t put quotes around node because then it will be a string, not a variable.