union–find data structure

The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.