To implement Dijkstra’s shortest path algorithm on unweighted graphs so that…
PYQ GATE 2006
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 805 students.
Sign up free to check your answer
Sign up freeLoading lesson…