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

Tell us what’s happening:

I’m tried to pass in the instructions correctly at this stage but I end In error and indentation errors specifically, I need help

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)

# User Editable Region

        for node, distance in graph[current]:
            if distance + distances[current] < distances[node]:

# User Editable Region

    print(f'Unvisited: {unvisited}\nDistances: {distances}\nPaths: {paths}')
    
#shortest_path(my_graph, 'A')

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 43

You missed this instruction

Use the pass keyword to temporarily fill the body of the if.

Try to take your time and re-read the instructions carefully if you run into trouble.