最小生成树与拓扑排序.docVIP

最小生成树 代码： #includestdio.h #includestdlib.h #includestring.h #define MAX_NAME 5 #define MAX_VERTEX_NUM 20 typedef char Vertex[MAX_NAME];/*顶点名字串*/ typedef int AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];/*邻接距阵*/ struct MGraph/*定义图*/ {Vertex vexs[MAX_VERTEX_NUM]; AdjMatrix arcs; int vexnum,arcnum; }; typedef struct {Vertex adjvex;/*当前点*/ int lowcost;/*代价*/ }minside[MAX_VERTEX_NUM]; int LocateVex(MGraph G,Vertex u)//定位 {int i; for(i=0;iG.vexnum;++i)if(strcmp(u,G.vexs[i])==0)return i; return-1; } void CreateGraph(MGraphG) {int i,j,k,w; Vertex va,vb; printf(请输入无向网G的顶点数和边数(以空格为分隔)\n); scanf(%d