A

Admin • 831.35K Points
Coach

Q. Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?

  • (A) max priority queue
  • (B) stack
  • (C) circular queue
  • (D) min priority queue
Explanation by: Admin
minimum priority queue is the most commonly used data structure for implementing dijkstra’s algorithm because the required operations to be performed in dijkstra’s algorithm match with specialty of a minimum priority queue.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.