×

Multiple-Choice Questions

The data structure primarily used to implement Dijkstra's Algorithm is ____.

7. The data structure primarily used to implement Dijkstra's Algorithm is ____.

  1. Stack
  2. ArrayList
  3. Priority Queue
  4. Linked List

Answer

The correct answer is: C) Priority Queue

Explanation

A Priority Queue efficiently extracts the minimum distance vertex and updates the shortest paths in Dijkstra's Algorithm.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.