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

Python
1

Tell us what’s happening:

I am getting this wrong what am I missing? What should I be looking at differently?

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.2.1 Safari/605.1.15

Challenge Information:

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

2

Hi @Coleman !

So for this part:

        for node, distance in graph[current]:
            pass

your if statement is going to replace pass in the for loop, like this:

        for node, distance in graph[current]:
            if ...:
                pass

Happy coding!

1 Like
3

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.