To find the shortest path in a weighted graph using BFS, one can modify the algorithm to use _______ for determining the next node to explore.

  • Binary Search Tree
  • Linked List
  • Priority Queue
  • Stack
To find the shortest path in a weighted graph using BFS, one can modify the algorithm to use a priority queue for determining the next node to explore. This allows selecting the node with the minimum distance efficiently.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *