最小生成树【克鲁斯卡尔】【并查集】

package lanqiao;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class MinTree {
	static int[] parents;
	static int[] ranks;
	public static void main(String[] args) throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String[] s = reader.readLine().split(" ");
		int amtNode = Integer.parseInt(s[0]);
		parents = new int[amtNode+1];
		Arrays.fill(parents, -1);
		ranks = new int[amtNode+1];
		Arrays.fill(ranks, 0);
		int amtEdges = Integer.parseInt(s[1]);
		List list = new ArrayList<>();
		for(int i=0;iranks[yRoot]) {
				parents[yRoot] = xRoot;
			}else if(ranks[xRoot]{
	int u;
	int v;
	int w;
	public node(int u2, int v2, int w2) {
		// TODO Auto-generated constructor stub
		this.u=u2;
		this.v=v2;
		this.w=w2;
	}
	@Override
	public int compareTo(node o) {
		// TODO Auto-generated method stub
		return Integer.compare(this.w, o.w);
	}
	@Override
	public String toString() {
		return "node [u=" + u + ", v=" + v + ", w=" + w + "]";
	}
	
}