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

Python
1

Tell us what’s happening:

I’ve looked others solutions but mine isn’t working and I can’t figure out why it’s not that complex and I understand it so I am very confused.

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 node == start else node == 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/134.0.0.0 Safari/537.36

Challenge Information:

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

3

in the else you need to give the value to put when the condition is false, not a different comparison

4

Thank you for a fast reply. :slight_smile: