Solving Dijkstra's algorithm - passing costs / parents with two edges

Question

I have a graph like this:

# graph table
graph = {}
graph[\'start\'] = {}
graph[\'start\'][\'a\'] = 5
graph[\'start\'][\'b\'] = 2

graph[\'a\'] = {}
graph[\'a\