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

Tell us what’s happening:

i am getting this error,
You should assign distance + distances[current] to the neighbor node distance inside your new if .

not sure what i am doing wrong

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)]
}

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

    while unvisited:
        current = min(unvisited, key=distances.get)
        for node, distance in graph[current]:

# User Editable Region

            if distance + distances[current] < distances[node]:
               distances[node] = distance + distances[current]
               
    print(f'Unvisited: {unvisited}\nDistances: {distances}\nPaths: {paths}')

# User Editable Region

    
#shortest_path(my_graph, 'A')

Your browser information:

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 39

Indentation is not valid in the second code line. Python is very sensitive when it comes to indentation. Indent to the right the second line by one blank space min.