DisjointSet 并查集算法

观正月点灯笼老师所得代码
https://www.bilibili.com/video/BV13t411v7Fs?p=3

package suanfa;
import java.util.*;
public class DisjointSet {
public static void main(String[] args) {
int parent[]=new int [vertices];
int[] rank=new int [vertices];
init(parent,rank);
int[][] edges = { {0,1},{1,2},{1,3},{2,4},{3,4},{2,5} }; // 边集
for (int i = 0; i < 6; i++){
int x = edges[i][0];
int y = edges[i][1];
if (union(x, y, parent,rank) == 0){
System.out.println(“Cycle detected!”);
System.exit(0);
}
}
System.out.println(“No cycle found.”);
}
static int vertices=6;
public static void init(int[] parent,int[] rank) {
for(int i=0;i<vertices;i++) {
parent[i]=-1;
rank[i]=0;
}
}
public static int findroot(int x,int[] parent) {
int x_root=x;
while(parent[x_root]!=-1) {
x_root=parent[x_root];
}
return x_root;
}
public static int union(int x,int y,int[] parent,int[] rank) {
int x_root=findroot(x,parent);
int y_root=findroot(y,parent);
if(x_root==y_root) {
return 0;
}else {
if(rank[x_root]>rank[y_root]) {
parent[y_root]=x_root;
}else if(rank[y_root]>rank[x_root]){
parent[x_root]=y_root;
}else {
parent[x_root]=y_root;
rank[y_root]++;
}
return 1;
}
}

}