When groups keep merging and you must keep asking whether two items are in the same group, rerunning BFS each time is too slow. Union-Find answers both operations in nearly O(1) using path compression and union by size. Use it for connected components with edges added over time, detecting a cycle in an undirected graph and Kruskal's minimum spanning tree. It cannot split groups apart, so it does not fit problems that remove edges.