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