Examine pseudo code and find line number having incorrect statement in Dijkstra's algorithm given below. [CO3;...

  

Transcribed Image Text:

Examine pseudo code and find line number having incorrect statement in Dijkstra's algorithm given below. [CO3; BL3; PI 1.7.1] Algorithm 1. 2. 3. 4. 5. 6. 7. 8. 9. V is the starting vertex Initialize visited array to 0. Initialize all elements of distance array as dist [i]= cost [v] [i] visited[v]=1 num=1 while (num <n) { u= choose(dist, n); num = num + 1; for w=1 to n { if (! visited[w]) if (dist[u]+ cost[u][w]>dist[w]) dist[w] = dist[u]+cost[u][w] } 10. 11. 12. 13. 14. dist array contains the shortest paths from V to all other destinations. 15. Stop O Line No. 6 O Line No. 10 O Line No. 11 Line No. 12 Examine pseudo code and find line number having incorrect statement in Dijkstra's algorithm given below. [CO3; BL3; PI 1.7.1] Algorithm 1. 2. 3. 4. 5. 6. 7. 8. 9. V is the starting vertex Initialize visited array to 0. Initialize all elements of distance array as dist [i]= cost [v] [i] visited[v]=1 num=1 while (num <n) { u= choose(dist, n); num = num + 1; for w=1 to n { if (! visited[w]) if (dist[u]+ cost[u][w]>dist[w]) dist[w] = dist[u]+cost[u][w] } 10. 11. 12. 13. 14. dist array contains the shortest paths from V to all other destinations. 15. Stop O Line No. 6 O Line No. 10 O Line No. 11 Line No. 12

Answer rating: 100% (QA)

The detailed answer for the above question is provided below The incorrect statement in the Dijkstras algorithm pseudocode is on line 11 The statement should be if distu costuw distw The original stat... View the full answer