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

Tell us what’s happening:

Hi there,
I need some guidance on this one.
I have been able to set ‘A’ to zero by either entering start, and a ‘A’ itself. However, ‘A’ through to ‘D’ all possess the value zero in the console with either entry.
I am at a loss on what else to enter in my ‘else’ statement to ensure ‘B’ through to ‘D’ do not also have a zero output in the console.

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/136.0.0.0 Safari/537.36

Challenge Information:

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

Hi @sky_valley

What is your condition checking?

Happy coding