The data structure to be used to implement Dijkstra's shortest path algorithm on unweighted graphs so that it runs in linear time is a Queue.

ONE SOLUTION