In Java implementation of Kruskal's algorithm where exactly should we perform Path Compression?

Question

在使用Disjoint集在Java中实现Kruskal算法时，我们应该将路径压缩称为单独的功能，还是应该作为find（）功能的组成部分？

Answer 1

Path compression and other optimizations like union-by-rank should be applied any time you call the find operation on your disjoint-set forest.

One way to see this: from the perspective of Kruskal's algorithm, you just need to be able to call find and union and have them work correctly. You shouldn't need to worry about the details of how you're making find and union work correctly, just that they do. It's the responsibility of the disjoint-set forest to ensure that everything runs quickly, and so the calls to find are where you'll see the compression occurring.