(Solved): Use Dijkstra's algorithm to find the shortest path from u to w for the following graph. (i) The tab ...

Use Dijkstra's algorithm to find the shortest path from $u$ to $w$ for the following graph. (i) The table below is similar to Table 10.6.1. Fill in the missing entries to show the action of the algorithm. The table shows the lengths of the shortest paths from $u$ to all the other vertices of the graph. In particular, it shows that the shortest path from $u$ to $w$ has length