union find (disjoint set structure) (Disjoint Set Union) efficiently tracks connected components with near union and find operations using path compression and union by rank. You use it when dynamically grouping elements and querying connectivity. Unlike BFS/DFS which processes edges at query time, Union Find preprocesses connections for instant queries.
You'll see this in connectivity and graph component problems.
