GATE Papers >> CSE >> 2006 >> Question No 4

Question No. 4 CSE | GATE 2006

To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, then data structure to be used is

(A) Queue (B) Stack
(C) Heap (D) B-Tree

Answer :


Comments
No Comments
Leave a comment
Go