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

Python
1

Tell us what’s happening:

I checked and think the code is right, but something seems wrong. Any idea?

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:
        distances = 0

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/125.0.0.0 Safari/537.36

Challenge Information:

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

2

Remember that indentation is very important in python.

3

the if statement needs to go inside the loop

4

Remember you are adding keys and values to a dictionary. it would be like distances[node]=0 where distances is the dictionary, node is the key and 0 is the value.

2 Likes