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

Python
1

Tell us what’s happening:

I have created the If statement based on the instructions. i think I have the right syntax as well still the code doesn’t pass. i cant get my head over what I am missing here.
for node, distance in graph[current]:
pass
if distance + distances[current] < distances[node]:
pass

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]:
            pass
            if distance + distances[current] < distances[node]:
                pass

# 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 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/17.5 Safari/605.1.15

Challenge Information:

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

2

Welcome to our community!

You don’t need the first ‘pass’ keyword.

3

thank you that works

1 Like