GATE | GATE-CS-2006 | Question 12

To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:
(A) Queue
(B) Stack
(C) Heap
(D) B-Tree

Answer: (A)
Explanation: See Question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-18/amp/
Quiz of this Question