-
最小生成树：是将图中的顶点全部连通，但是其权值之和要求最小
/*** 最小生成树：两种方式，普里姆算法和克鲁斯卡尔算法* @author timmy1**/public class MinSpanTree {int[][] matrix;// 矩阵int MAX_WEIGHT = Integer.MAX_VALUE;int size;// 顶点个数/*** 普里姆算法实现最小生成树：先初始化拿到第一个顶点相关联的权值元素放到数组中－》找到其中权值最小的顶点下标－》再根据该下标，将该下标顶点相关联的权值加入到数组中－》循环遍历处理*/public void prim(){int[] tempWeight = new int[size];// 临时存放顶点权值的数组，每次循环都要从中获取到最小权值和顶点下标int minWeight;//最小权值int minId;//最小权值顶点int sum = 0;//权值总和//先初始化将第一行的顶点权值存放到临时权值数组中for(int i =0;i<size;i++){tempWeight[i] = matrix[0][i];}PrintUtil.print("从顶点0开始查找");for(int i=1;i<size;i++){//每次循环都找出临时顶点权值的最小的权值minWeight = MAX_WEIGHT;minId = 0;for(int j=1;j<size;j++){if(tempWeight[j] >0 && tempWeight[j]<minWeight){minWeight = tempWeight[j];minId = j;}}//找到目标顶点minId,他的权值为minweight。PrintUtil.print("找到顶点:"+minId+" 权值为："+minWeight);sum+=minWeight;//根据找到的顶点minid，将这一行的所有相关联的顶点权值添加到临时权值数组中tempWeight[minId] = 0;for(int j = 1;j<size;j++){if(tempWeight[j] != 0&& matrix[minId][j]<tempWeight[j]){tempWeight[j] = matrix[minId][j];}}}PrintUtil.print("最小权值总和为："+sum);}private void createGraph(int index) {size = index;matrix = new int[index][index];int[] a0 = { 0, 10, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 11, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT };int[] a1 = { 10, 0, 18, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 16, MAX_WEIGHT, 12 };int[] a2 = { MAX_WEIGHT, MAX_WEIGHT, 0, 22, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 8 };int[] a3 = { MAX_WEIGHT, MAX_WEIGHT, 22, 0, 20, MAX_WEIGHT, 24, 16, 21 };int[] a4 = { MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 20, 0, 26, MAX_WEIGHT, 7, MAX_WEIGHT };int[] a5 = { 11, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 26, 0, 17, MAX_WEIGHT, MAX_WEIGHT };int[] a6 = { MAX_WEIGHT, 16, MAX_WEIGHT, 24, MAX_WEIGHT, 17, 0, 19, MAX_WEIGHT };int[] a7 = { MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 16, 7, MAX_WEIGHT, 19, 0, MAX_WEIGHT };int[] a8 = { MAX_WEIGHT, 12, 8, 21, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 0 };matrix[0] = a0;matrix[1] = a1;matrix[2] = a2;matrix[3] = a3;matrix[4] = a4;matrix[5] = a5;matrix[6] = a6;matrix[7] = a7;matrix[8] = a8;}public static void main(String[] args) {MinSpanTree graph = new MinSpanTree();graph.createGraph(9);graph.prim();}}
打印结果：
从顶点0开始查找
找到顶点:1 权值为：10
找到顶点:5 权值为：11
找到顶点:8 权值为：12
找到顶点:2 权值为：8
找到顶点:6 权值为：16
找到顶点:7 权值为：19
找到顶点:4 权值为：7
找到顶点:3 权值为：16
最小权值总和为：99