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

Tell us what’s happening:

I get the error that I should have two iterating variables in the for loop, but I believe I already do.

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)

/* User Editable Region */

    while unvisited:
        current = min(unvisited, key=distances.get)
        for i and a in graph[current]: 
            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 (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 37

Hello Imoh,

Unfortunately and doesn’t work that way. That is for comparisons. Instead you might want to use the comma.

1 Like