Prim算法求最小生成树,也就是在包含n个顶点的连通图中,找出只有(n-1)条边包含所有n个顶点的连通子图,也就是所谓极小连通图。思路看着有点长,不好理解,直接上代码吧。
import java.util.Arrays;
public class PrimAlgorithm {
public static void main(String[] args) {
// TODO Auto-generated method stub
char[] data = new char[] { 'A', 'B', 'C', 'D', 'E', 'F', 'G' };
int verxs = data.length;
// 邻接矩阵的关系使用二维数组表示,10000这个数表示两个点不连通
int[][] weight = new int[][] { { 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 graph = new MGraph(verxs);
MinTree minTree = new MinTree();
minTree.createGraph(graph, verxs, data, weight);
minTree.showGraph(graph);
minTree.prim(graph, 0);
}
}
//创建最小生成树→村庄的图
class MinTree {
// 创建图的邻接矩阵
public void createGraph(MGraph graph, int verxs, char[] data, int[][] weight) {
int i, j;
for (i = 0; i < verxs; i++) {
graph.data[i] = data[i];
for (j = 0; j < verxs; j++) {
graph.weight[i][j] = weight[i][j];
}
}
}
// 显示图的邻接矩阵
public void showGraph(MGraph graph) {
for (int[] link : graph.weight) {
System.out.println(Arrays.toString(link));
}
}
// 编写Prim算法,得到最小生成树,v表示从第几个顶点开始生成
public void prim(MGraph graph, int v) {
int[] visited = new int[graph.verxs];
// 把当前这个结点标记为已访问
visited[v] = 1;
// h1和h2记录两个顶点的下标
int h1 = -1;
int h2 = -1;
int minWeight = 10000;// 将minWeight初始成一个大数,后面在遍历过程中会被替换
for (int k = 1; k < graph.verxs; k++) {// 因为有graph.verxs顶点,算法结束后有graph.verxs-1条边
// 确定每一次生成的子图,和哪个结点的距离最近
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(寻找已经访问过的结点和未访问过的结点间的权值最小的边)
minWeight = graph.weight[i][j];
h1 = i;
h2 = j;
}
}
}
// 找到一条边是最小,将当前这个结点标记为已访问
System.out.println("边<" + graph.data[h1] + "," + graph.data[2] + "> 权值:" + minWeight);
visited[h2] = 1;
// minWeight重新设置为最大值
minWeight = 10000;
}
}
}
class MGraph {
int verxs;// 图的结点个数
char[] data;// 存放结点数据
int[][] weight;// 存放边,也就是我们的邻接矩阵
public MGraph(int verxs) {
this.verxs = verxs;
data = new char[verxs];
weight = new int[verxs][verxs];
}
}