Suppose we want to apply the Dijkstra$$s algorithm

to find the shortest path from node $0$ to node $6$ in

the previous figure. We will update data in the right

table until the target node $6$ gets picked.

Q$1$: show all numbers in the Shortest Time column

from top to bottom $($including the first $0$;