利用最小生成樹找到能夠遍歷全部節點的最短路徑

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("data.txt")));
        String[] inputs = br.readLine().trim().split(" ");
        int n = Integer.parseInt(inputs[0]);
        int m = Integer.parseInt(inputs[1]);
        int[][] edge = new int[n + 1][n + 1];

        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= n; j++) {
                edge[i][j] = -1;
            }
        }
        String[] us = br.readLine().trim().split(" ");
        String[] vs = br.readLine().trim().split(" ");
        String[] ws = br.readLine().trim().split(" ");

        for (int i = 0; i < m; i++) {
            int u = Integer.parseInt(us[i]);
            int v = Integer.parseInt(vs[i]);
            int len = Integer.parseInt(ws[i]);
            edge[u][v] = len;
            edge[v][u] = len;
        }

        Map<Integer, Integer> mp = new HashMap<>(); // 用來記錄已訪問的節點
        List<Integer> vt = new ArrayList<>(); // 訪問順序

        // 從第一個節點開始
        mp.put(1, 1);
        vt.add(1);

        long ans = 0;
        int minLen;
        int node;
        for (int i = 0; i < n - 1; i++) { // 總共有n-1條邊
            minLen = Integer.MAX_VALUE;
            node = -1;
            for (int cur : vt) { // 選擇離選點最近的點
                for (int k = 1; k <= n; k++) { // 在 1 - n 中查找節點
                    if (mp.containsKey(k)) continue; // 跳過已選擇的點
                    if (edge[cur][k] == -1) continue; // 無邊
                    // 找到最小的邊
                    if (edge[cur][k] < minLen) {
                        node = k;
                        minLen = edge[cur][k];
                    }
                }
            }
            ans += minLen;
            mp.put(node, 1); // 標記為已選擇
            vt.add(node);
        }
        System.out.println(ans);
    }
}