GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

asked in Graph search, minimum spanning trees, shortest paths by gate

1 Answer

0 votes
Queue

BFS traversal of the graph to get the shortest paths
answered by gate

Related questions

The best answer to any question