4. Calculation (44 points) 1) Using the Dijkstra shortest-path algorithm, one can compute the shortest path...

 

Transcribed Image Text:

4. Calculation (44 points) 1) Using the Dijkstra shortest-path algorithm, one can compute the shortest path from node u to all network nodes. Given a 6-node network illustrated in the figure below. The table underneath indicates the steps deriving the cost (denoted by D) and previous hop (denoted by p) on the shortest paths. 4. Calculation (44 points) 1) Using the Dijkstra shortest-path algorithm, one can compute the shortest path from node u to all network nodes. Given a 6-node network illustrated in the figure below. The table underneath indicates the steps deriving the cost (denoted by D) and previous hop (denoted by p) on the shortest paths.