1
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
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

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies