java prim

package com.gxmedu.prim;

import java.util.Arrays;

/**
 * @author 郭学明
 * @version 1.0
 */
public class MGraph {
    int vertexNum;
    char[] data;
    int[][] edgeWeight;
    public MGraph(int vertexNum){
        this.vertexNum = vertexNum;
        data = new char[vertexNum];
        edgeWeight = new int[vertexNum][vertexNum];
    }
    public void fillGraph(char[] data,int[][] edgeWeight){
        this.data = data;
        this.edgeWeight = edgeWeight;
    }
    public void showGraph(){
        for (int i = 0; i < vertexNum ; i++) {
            System.out.println(Arrays.toString(edgeWeight[i]));
        }
    }
}

package com.gxmedu.prim;

/**
 * @author 郭学明
 * @version 1.0
 */
public class MinimumCostSpanningTree {
    public static void main(String[] args) {
        char[] data = new char[]{'A','B','C','D','E','F','G'};
        int vertexNum = data.length;
        int[][] weight = new int[][]{
                {-1,5,7,-1,-1,-1,2},
                {5,-1,-1,9,-1,-1,3},
                {7,-1,-1,-1,8,-1,-1},
                {-1,9,-1,-1,-1,4,-1},
                {-1,-1,8,-1,-1,5,4},
                {-1,-1,-1,4,5,-1,6},
                {2,3,-1,-1,4,6,-1}
        };
        MGraph g1 = new MGraph(vertexNum);
        g1.fillGraph(data,weight);
        MinimumCostSpanningTree mst = new MinimumCostSpanningTree();
        mst.prim(g1,0);


    }
    public void prim(MGraph g,int origin){
        boolean[] isVisited = new boolean[g.vertexNum];
        isVisited[origin] = true;

//        在接下来的每一轮挑出当前顶点集的权值最小的边加入顶点集
//        这里用两个循环来得到一个已访问结点与一个未访问结点的权值
        for (int i = 1; i < g.vertexNum; i++) {
            int minWeight = -1;
            int bestVertex1 =  -1;
            int bestVertex2 =  -1;
            for (int j = 0; j < g.vertexNum; j++) {
//                寻找已访问顶点，若找到未访问结点跳出当前循环
                if(!isVisited[j]){
                    continue;
                }
                for (int k = 0; k < g.vertexNum; k++) {
//                    寻找未访问顶点,若找到已访问结点,或边无效，则跳出当前循环
                    if(isVisited[k] || g.edgeWeight[j][k] == -1){
                        continue;
                    }
//                    if(minWeight == -1){
//
//                    }
                    if(g.edgeWeight[j][k] < minWeight || minWeight == -1){
                        minWeight = g.edgeWeight[j][k];
//                        isVisited[k] = true;
                        bestVertex1 = j;
                        bestVertex2 = k;
                    }
                }
            }
            isVisited[bestVertex2] = true;
            System.out.printf("此轮连接%c->%c,权值为%d\n",g.data[bestVertex1],g.data[bestVertex2],g.edgeWeight[bestVertex1][bestVertex2]);

        }
    }
}