In Adaptive Routing method, there are two common methods used for routing packets. One of them is known as Link-State Routing or Djisktra algorithm. By using Link-State Routing, and based on figure below with the nodes diagram along with their distance from one to another, complete the table and update from one round to another, in trying to find the shortest path available. Assume E is the starting node.

In Adaptive Routing method, there are two common methods used for routing packets. One of them is known as Link-State Routing or Djisktra algorithm. By using Link-State Routing, and based on figure below with the nodes diagram along with their distance from one to another, complete the table and update from one round to another, in trying to find the shortest path available. Assume E is the starting node.

This the all question plz answer ASAP

A's states on Sinks B's states of links C's states of links D's states of links D E E's states of links Dalarn kaedah Adaptive Routing, terdapat dua kaedah yang digunakan untuk menghala paket di dalam rangkaian. Salah satu daripadanya dikenali sebagal Link State Routing atau algorithma Djisktra. Dengan menggunakan Link-State Routing, dan berdasarkan kepada rajah dibawah serta nod bersama-sama jarak antara satu sama lain, lengkapkan jadual kemaskini dari satu pusingan ke pusingan seterusnya dalarn mencari jarak terpendek yang boleh diperolehi. Andaikan nod E sebagai pemula. in Adaptive Routing method. There are two common methods used for routing packets. One of them is known as Link State Routing or bystra algorithm. By using Link-State Routing and based on figure below with the nodes diaram along with their distance from one to another complete the table and update from one round to another, in trying to find the shortest path available Assume is the starting node A states of links Mer of links Cates e links hate of states of in 7 " BIT % 83 o Ma 00 * ENG