Question: Which of the following is NOT a typical use case for Disjoint Set Union?

Options:

1. Kruskal\'s algorithm for Minimum Spanning Tree
2. Finding connected components in a graph
3. Implementing a priority queue
4. Dynamic connectivity queries

Correct Answer: Implementing a priority queue

Solution:

Implementing a priority queue is not a typical use case for Disjoint Set Union; it is primarily used for managing disjoint sets.