用Prim算法求解图最小生成树.docVIP

用Prim算法求解图中的最小生成树（采用邻接矩阵存储） #includestdio.h #define FINITY 5000 //代表无穷大 #define M 20 #define OK 1 typedef int Status; typedef char vertextype; typedef int edgetype; typedef struct { vertextype vexs[M]; edgetype edges[M][M]; int n,e; }mgraph; typedef struct edgedata { int beg,en; int length; }edge; Status createmgraph(mgraph g) { //建立有向网络的邻接矩阵存储结构 int i,j;int k,w; g.n=6;g.e=10; g.vexs[0]=A; g.vexs[1]=B; g.vexs[2]=C; g.vexs[3]=D; g.vexs[4]=E; g.vexs[5]=F; for(i=0;ig.n;i++) for(j=0;jg.n;j++) g.edges[i][j]=FINITY; g.edges[0][1]=10; g.edges[0][2]=12; g.edges[0][4]=1