'why do we use Union Find datastructure in graphs?

I am learning graph algorithms, my next stopping point is Kruskals algorithm, in every implementation video I've watched union find is used. I understood the implementation but why do we use it in the first place and not a list of lists - what we generally use?

algorithmdata-structuresgraph


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions