Question: 3 17 31 E j B 15 23 23 19 13 22 29 D F 13 17 12 22 4 15 Figure 1 (Rajah 1)

3 17 31 E j B 15 23 23 19 13 22 29 D F 13 17 12 22 4 15 Figure 1 (Rajah 1) Referring to Figure 1, answer the following questions [Merujuk kepada rajah 1, jawab soalan-soalan dibawah) a. Compute the operation of Dijkstra's (LinkState) algorithm from node A to all destination. [Kirakan operasi Dijkstra's (LinkState) algorithm daripada nod A ke semua destinasi.) [10 marks/markah] b. Compute and list the least cost path from A to nodes B-J. List the steps. [Kirakan dan senarailan least cost path daripada A ke nod B-J. Senaraikan langkah-langkahnya] [7 marks/markah] c. Compute the distance vectors in nodes C. Kirakan distance vectors di nod C) [6 marks/markah]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
