Question: 5. Consider a weighted undirected graph with 5 nodes A, B, C, D, and E, with all weights in the range 1 to 9. (1)
5. Consider a weighted undirected graph with 5 nodes A, B, C, D, and E, with all weights in the range 1 to 9. (1) Draw such a graph so that, when the Dijkstra algorithm is applied to it to find the shortest path from A to B, at every iteration of the algorithm a shorter path from A to B is found [5 marks] (ii) Demonstrate the execution of the algorithm on this graph by writing out the table of execution steps in the same format as was given in the lectures. [10 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
