Q84
Which data structure is used for implementing efficient algorithms for finding the shortest path in graphs?
A.
Deque
B.
Heap
C.
Priority Queue
AnswerD.
Stack
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board