# Learn Algorithm Design by Building a Shortest Path Algorithm - Step 24

### Tell us what’s happening:

Im not sure what to try anymore, ive tried many different combos of brackets and whatnot and cant seem to find the answer to assign this float infinity, any hints please.

``````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 = []
distances = {}
for node in graph:
unvisited.append(node)
if node == start:
distances[node] = 0
else
distances[node] = float('inf')

# User Editable Region

``````

User Agent is: `Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:122.0) Gecko/20100101 Firefox/122.0`

### Challenge Information:

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

Looking good. Take a look at this if/else structure:

``````if b > a:
print("b is greater than a")
else:
print("a is greater than b")
``````

You are just missing a colon