Q42
Which of the following properties is essential for the efficient implementation of Dijkstra's algorithm?
A.
An adjacency matrix for fast access.
B.
A stack to keep track of visited nodes.
C.
A hash table for node storage.
D.
A priority queue or min-heap to extract the minimum distance.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board