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

Tell us what’s happening:

I feel like im creating a variable for target_to_print but its not accepting it. Please let me know what im doing wrong

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, target = ''):
    unvisited = list(graph)
    distances = {node: 0 if node == start else float('inf') for node in graph}
    paths = {node: [] for node in graph}
    while unvisited:
        current = min(unvisited, key=distances.get)
        for node, distance in graph[current]:
            if distance + distances[current] < distances[node]:
                distances[node] = distance + distances[current]
                if paths[node] and paths[node][-1] == node:
                    paths[node] = paths[current][:]

# User Editable Region

    targets_to_print if target else my_graph

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

Challenge Information:

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

This way you’re not creating a variable. The example in the instructions

val_1 if condition else val_2

represents just an expression you can assign to a variable:

variable_name = val_1 if condition else val_2
1 Like