蛮力法分析库卢卡尔关于小生成树的算法设计分析.docVIP

算法设计与分析实验报告三 题目内容： 蛮力法分析库卢卡尔关于最小生成树的算法设计分析 Prim算法 和 Kruskal算法Prim算法逐次将最小权的边和相应顶点加到集合中，适合于求边稠密的最小生成树；Kruskal算法先将所有边都放入集合，然后再逐个选择最小权的边，适合于求稀疏的网的最小生成树。 #includestdio.h?#includestdlib.h? #define?M?20?#define?MAX?20?typedef?struct?{?int?begin;?int?end;?int?weight;?}edge;?typedef?struct?{int?adj;?int?weight;??}AdjMatrix[MAX][MAX];?typedef?struct?{??AdjMatrix?arc; int vexnum, arcnum; }MGraph; void CreatGraph(MGraph *); void sort(edge* ,MGraph *); void MiniSpanTree(MGraph *); int Find(int *, int ); void Swapn(edge *, int, int); void CreatGraph(MGraph *G) { int i, j,n, m; printf(请输入边数和顶点数:); scanf(%d %d,G-arcnum,G-vexnum); for (i = 1; i = G-vexnum; i++) { for ( j = 1; j = G-vexnum; j++) { G-arc[i][j].adj = G-arc[j][i].adj = 0; } } for ( i = 1; i = G-arcnum; i++) { printf(\n请输入有边的2个顶点); scanf(%d %d,n,m); while(n 0 || n G-vexnum || m 0 || n G-vexnum) { printf(输入的数字不符合要求 请重新输入:); scanf(%d%d,n,m); } G-arc[n][m].adj = G-arc[m][n].adj = 1; getchar(); printf(\n请输入%d与%d之间的权值:, n, m); scanf(%d,G-arc[n][m].weight); } printf(邻接矩阵为:\n); for ( i = 1; i = G-vexnum; i++) { for ( j = 1; j = G-vexnum; j++) { printf(%d ,G-arc[i][j].adj); } printf(\n); } } void sort(edge edges[],MGraph *G) { int i, j; for ( i = 1; i G-arcnum; i++) { for ( j = i + 1; j = G-arcnum; j++) { if (edges[i].weight edges[j].weight) { Swapn(edges, i, j); } } } printf(权排序之后的为:\n); for (i = 1; i G-arcnum; i++) { printf( %d, %d %d\n, edges[i].begin, edges[i].end, edges[i].weight); } } void Swapn(edge *edges,int i, int j) { int temp; temp = edges[i].begin; edges[i].begin = edges[j].begin; edges[j].begin = temp; temp = edges[i].end; edges[i].end = edges[j].end; edges[j].end = temp; temp = edges[i].weight; edges[i].weight = edges[j].weight; edges[j].weight = temp; } void Mini