To implement Dijkstra’s shortest path algorithm on unweighted graphs so that…
GATE · 2006 · CSTPSC Computer/IT Posts · 2025 · Senior Informatics Officer · Section D
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
Attempted by 646 students.
Sign up free to check your answer
Sign up freeLoading lesson…