Algorithms | Graph Shortest Paths | Question 2

Last Updated :
Discuss
Comments
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:
Queue
Stack
Heap
B-Tree

This question is part of this quiz :

Shortest Paths in Graphs Quiz
Tags:
DSA Quiz
Share your thoughts in the comments