最小生成树的应用数据结构课程设计

int i,d,m,g[20][20]; char a='a'; int s; char y='y'; while(y='y'){

printf(\ …………最小生成树的求法…………\\n\

printf(\ ____________________________________________\\n\ printf(\ | 1.建立邻接矩阵(无向图) |\\n\ printf(\ printf(\ printf(\ printf(\ cin>>s; switch(s)

{case 1: 时\

break;

case 2: case 3:

| 2.用prim算法求最小生成树(无向图) ||\\n\ | 3.用kruskal算法求最小生成树 |\\n\ |___________________________________________ |\\n\ ______________请选择相应的菜单(1-3) :\d=creatMGraph(G); vnode v;

cout<

for(int j=0;j!=G.vexnum;++j)g[i+1][j+1]=G.arcs[i][j].adj; prim(g,d); break;

cout<<\算法求解如下：\

23

D = (MGraphA*)malloc(sizeof(MGraphA)); CreatGraph(D); MiniSpanTree(D); break; } printf(\

cout<>y;

if(y=='n') break; } }

24