Prim算法求图的最小生成树（Java）

package Algorithm.prim;

import java.util.Arrays;

/**
 * 普利姆算法解决最小生成树问题
Prim算法的实现过程
首先以一个结点作为最小生成树的初始结点，然后以迭代的方式找出最小生成树中各结点权重最小的边，并加到最小生成树中。（加入之后如果产生回路了就要跳过这条边，选择下一个结点）当所有的结点都加入到最小生成树中后，就找出了这个连通图的最小生成树
 */
public class PrimAlgorithm {
    public static void main(String[] args) {
        char[] data = {'A','B','C','D','E','F','G'};
        int verxs = data.length;

        int[][] weight = {
                {10000,5,7,10000,10000,10000,2},
                {5,10000,10000,9,10000,10000,3},
                {7,10000,10000,10000,8,10000,10000},
                {10000,9,10000,10000,10000,4,10000},
                {10000,10000,8,10000,10000,5,4},
                {10000,10000,10000,4,5,10000,6},
                {2,3,10000,10000,4,6,10000}
        };

        //创建MGraph对象
        MGraph mGraph = new MGraph(verxs);

        //创建最小生成树对象
        MinTree minTree = new MinTree();
        minTree.createGraph(mGraph,verxs,data,weight);
        minTree.showGraph(mGraph);

        minTree.prim(mGraph,0);
    }
}

//创建最小生成树，即村庄的图
class MinTree {

    /**
     * 创建图
     * @param graph 图对象
     * @param verxs 图对应的顶点个数
     * @param data 图中各个顶点的值
     * @param weight 图的邻接矩阵
     */
    public void createGraph(MGraph graph, int verxs, char data[], int[][] weight) {

        for ( int i = 0; i < verxs; i++ ) {
            graph.data[i] = data[i];
            for ( int j = 0; j < verxs; j++ ) {
                graph.weight[i][j] = weight[i][j];
            }
        }

    }

    /**
     * Prim算法得到最小生成树
     * @param graph 图
     * @param v 从图的某个顶点开始搜索
     */
    public void prim( MGraph graph, int v ) {
        int[] visited = new int[graph.verxs]; // 标记节点是否被访问过:0表示没有访问过，1表示已经访问。

        visited[v] = 1;

        //h1 和 h2 记录两个顶点的下标
        int h1 = -1;
        int h2 = -1;
        int minWeight = 10000;

        for ( int k = 1; k < graph.verxs; k++ ) {

            for (int i = 0; i < graph.verxs; i++){ // i表示被访问过的节点
                for (int j = 0; j < graph.verxs; j++){ // j表示未被访问的节点
                    if (visited[i] == 1 && visited[j] == 0 && graph.weight[i][j] < minWeight) {
                        minWeight = graph.weight[i][j]; //寻找已访问节点和未被访问节点之间权值最小的边
                        h1 = i;
                        h2 = j;
                    }
                }
            }
            System.out.println("边<"+graph.data[h1]+","+graph.data[h2]+"> 权值:"+minWeight);
            //将当前找到的节点标记为1
            visited[h2] = 1;
            minWeight = 10000;
        }

    }

    /**
     * 显示图的邻接矩阵
     * @param graph
     */
    public void showGraph(MGraph graph) {
//        for (int i = 0; i < graph.verxs; i++){
//            for (int j = 0; j < graph.verxs; j++){
//                System.out.printf("%d ",graph.weight[i][j]);
//            }
//            System.out.println();
//        }
        for (int[] link: graph.weight){
            System.out.println(Arrays.toString(link));
        }
    }
}

class MGraph {
    int verxs; // 表示图的节点个数
    char[] data; // 存放节点数据
    int[][] weight; // 存放边，即邻接矩阵

    public MGraph(int verxs) {
        this.verxs = verxs;
        data = new char[verxs];
        weight = new int[verxs][verxs];
    }
}