What specific data structure is typically used to efficiently implement Kruskal's algorithm for finding a Minimum Spanning Tree?

Disjoint-set (Union-Find)

Kruskal's algorithm processes edges in increasing order of weight and uses the Disjoint-set data structure to quickly determine if adding an edge would create a cycle. This keeps the complexity to O(E log E) or O(E log V).