NWC203c_-_SU_2024_-_PE1_2574.webp

Q4. (2 marks)
Consider the network in Figure.
1
3
2
5
3
2
1
6
1
4
2
3
2
4
5
a) Use the Dijkstra algorithm to find the set of shortest paths from node 4 to other nodes.
Iteration
Initial
N
D1 D2 D3 D5 D6
Zoom
+ 100%
Close