Dijkstra’s shortest-path (LS) routing algorithm
prasad0484
Chapter5Homeworksssss.docxUse Dijkstra’s shortest-path (LS) routing algorithm to compute the shortest-path from u to all network nodes. You need to show your work like Slide 14 or 16 on Chapter 5.
6
4
32
3
3
4
2
12
8
6
7
8
12
T
W
V
U
Y
X
Z
For the homework work are supposed to start with U node of T node?
You start from node U to find shortest path from U to every other node. You need to show your work like slide 14 or 16 in Chapter 5
Slide 14:
Slide16:
