java | 最小生成树模版

Kruskal

import java.io.*;
import java.util.Arrays;

public class 最小生成树 {
    public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static StreamTokenizer t = new StreamTokenizer(br);
    public static int nextInt() throws Exception {
        t.nextToken();
        return (int) t.nval;
    }
    public static int n, m, branch;
    public static int[] father;
    public static int find(int x) {
        return x == father[x] ? x : (father[x] = find(father[x]));
    }
    public static class Edge implements Comparable<Edge> {
        int u, v, w;
        public Edge(int u, int v, int w) {
            this.u = u;
            this.v = v;
            this.w = w;
        }
        @Override
        public int compareTo(Edge o) {
            return this.w - o.w;
        }
    }
    public static int kruskal() {
        int sum = 0;
        for (int i = 0; i < m; i += 1) {
            int fu = find(edges[i].u), fv = find(edges[i].v);
            if (fu != fv) {
                father[fu] = fv;
                sum += edges[i].w;
                branch -= 1;
            }
        }
        return sum;
    }
    public static Edge[] edges;
    public static void main(String[] args) throws Exception {
        n = nextInt();
        m = nextInt();
        branch = n;
        father = new int[n + 1];
        edges = new Edge[m];
        for (int i = 0; i <= n; i += 1) {
            father[i] = i;
        }
        for (int i = 0; i < m; i += 1) {
            edges[i] = new Edge(nextInt(), nextInt(), nextInt());
        }
        Arrays.sort(edges);
        int ans = kruskal();
        if (branch == 1) {
            System.out.print(ans);
        } else {
            System.out.print("orz");
        }

    }
}