5.01-4 Dijkstra's Algorithm (1, part 4). Consider the network shown below, and Dijkstra's link-state algorithm to...

Transcribed Image Text:

5.01-4 Dijkstra's Algorithm (1, part 4). Consider the network shown below, and Dijkstra's link-state algorithm to find the least cost path from source node U to all other destinations. Using the algorithm statement and its visual representation used in the textbook, complete the fourth row in the table below showing the link state algorithm's execution by matching the table entries (a), (b), (c), and (d) with their values. Write down your final [correct] answer, as you'll need it for the next question. The *s shown correspond to your answers to the earlier parts of this question; note that a couple of table entries are given for you (!).[Note: You can find more examples of problems similar to this here.] Step 0 (d) (c) (b) (a) 123 2 3 6,w 8,w 5,x uvxy 8 2 -X- N' u * (a) < 4 2 6 > > W X W X Z D(v),p(v) D(w),p(w) D(x),p(x) D(y).p(y) D(z).p(z) * * 3 * 1 2,u =Z3 1 * * * (b) * * * 3,u * * (c) 888 (d) 5.01-4 Dijkstra's Algorithm (1, part 4). Consider the network shown below, and Dijkstra's link-state algorithm to find the least cost path from source node U to all other destinations. Using the algorithm statement and its visual representation used in the textbook, complete the fourth row in the table below showing the link state algorithm's execution by matching the table entries (a), (b), (c), and (d) with their values. Write down your final [correct] answer, as you'll need it for the next question. The *s shown correspond to your answers to the earlier parts of this question; note that a couple of table entries are given for you (!).[Note: You can find more examples of problems similar to this here.] Step 0 (d) (c) (b) (a) 123 2 3 6,w 8,w 5,x uvxy 8 2 -X- N' u * (a) < 4 2 6 > > W X W X Z D(v),p(v) D(w),p(w) D(x),p(x) D(y).p(y) D(z).p(z) * * 3 * 1 2,u =Z3 1 * * * (b) * * * 3,u * * (c) 888 (d)