Generate the shortest path tree using the Dijkstra Algorithm using the following format: Note: using link state (OSPF) Shortest path tree for node A 1. Permanent list Tentative list empty A(0) 2. Permanent list Tentative list A(0) B(5), C(2), D(3)
Generate the shortest path tree using the Dijkstra
Note: using link state (OSPF)
Shortest path tree for node A
1.
Permanent list Tentative list
empty A(0)
2.
Permanent list Tentative list
A(0) B(5), C(2), D(3)
3.
Permanent list Tentative list
A(0), C(2) B(5), D(3), E(6)
4.
Permanent list Tentative list
A(0), C(2), D(3) B(5), D(3)
5.
Permanent list Tentative list
A(0), C(2), D(3), B(5) D(3)
6.
Permanent list Tentative list
A(0), C(2), D(3), B(5), D(3) empty
Step by step
Solved in 4 steps with 3 images