Consider the following statements for undirected, unweighted connected graphs:

• I. To implement Dijkstra\’s algorithm for linear time running complexity array data structure is used.
• II. The Shortest path from source node to every node is computed by Dijkstra\’s algorithm efficiently in terms of time complexity.
• III. If every edge weight is same in a weighted graph then Dijkstra\’s algorithm efficiently will find the shortest path from source to destination.

Which of the above options is correct?
(A) Statement I and II are false, statement III is true.
(B) Statement I and III are false, statement II is true.
(C) Statement II and III are false, statement I is true.
(D) All statement I, II, and III are false.


Answer: (D)

Explanation: For undirected, unweighted connected graphs:

• I. To implement Dijkstra\’s algorithm for linear time running complexity queue data structure is used.
• II. The Shortest path from source node to every node is computed by Breadth-first search efficiently in terms of time complexity.
• III. If every edge weight is same in a weighted graph then Breadth-first search efficiently will find the shortest path from source to destination.

So, option (D) is correct.

Quiz of this Question