To impement Dijkstra's shortest path algorithm on unweighted graphs so that it runs in linear time ,the data structure to be used is -

To impement 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

Solution

Correct Answer: Option A