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

Tell us what’s happening:

Hello, this question seems clear but I’m know why it tells me error. Please help tell errors In it

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, target = ''):
    unvisited = list(graph)
    distances = {node: 0 if node == start else float('inf') for node in graph}
    paths = {node: [] for node in graph}
    while unvisited:
        current = min(unvisited, key=distances.get)
        for node, distance in graph[current]:
            if distance + distances[current] < distances[node]:
                distances[node] = distance + distances[current]
                if paths[node] and paths[node][-1] == node:
                    paths[node] = paths[current][:]

# User Editable Region

    targets_to_print = [target] if target else graph

shortest_path(my_graph, 'A')

for node in targets_to_print:
    print(f'\n{start}-{node} distance: {distances[node]}\nPath: {" -> ".join(paths[node])}')

# 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 55

Hey there, you are just creating the for loop in the wrong place. You should do it inside your shortest_path function.