Question: Which algorithm uses a priority queue to find the minimum spanning tree?

Options:

1. Kruskal\'s algorithm
2. Prim\'s algorithm
3. Dijkstra\'s algorithm
4. Bellman-Ford algorithm

Correct Answer: Prim\'s algorithm

Solution:

Prim\'s algorithm uses a priority queue to efficiently select the next edge with the minimum weight to add to the spanning tree.