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

Tell us what’s happening:

Hi, I’m having a little trouble with step 35 of Learn Algorithm Design by Building a Shortest Path Algorithm. If someone could give me a hint I would really appreciate it. This is the console output:

Unvisited: [‘A’, ‘B’, ‘C’, ‘D’]
Distances: {‘A’: 0, ‘B’: 0, ‘C’: 0, ‘D’: 0}

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)]
}


# User Editable Region

def shortest_path(graph, start):
    unvisited = list(graph)
    distances = {node: 0 if start else float('inf') for node in graph}
    paths = {node: [] for node in graph}
    print(f'Unvisited: {unvisited}\nDistances: {distances}')
    
shortest_path(my_graph, 'A')

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/123.0.0.0 Safari/537.36 OPR/109.0.0.0

Challenge Information:

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

you want to expand this.

1 Like