离散数学上机最小生成树.doc

离散数学上机最小生成树.doc:..糾大学集合论与图论上机实验报告课程名称:集合论与图论年级:2014上机实验成绩:指导教师:姓名上机实验名称:最小生成树学号:3120140901109上机实验日期:2015-11-15上机实验编号:组号:上机实验时间:两课吋一、实验目的掌握图的存储表示和以及图的最小生成树算法。二、,并H读入图的内容。。。。三、使用环境Windows7vs2012四、核心代码及调试过程#include<iostream>usingnamespacestd;^defineMAX_VERTEX_NUM20#defineMAX200typedefstructClose{charadjvex;intlowcost;JClose,close[W\X_VERTEX_NUM];ode{intadjvex;ode*nextarc;intinfo;}ode;typedefstructVNodechardata;ode*firstarc;}VNode,AdjList[MAXVERTEXNUM];typcdefstruct{AdjListverties;intvexnum,um;}ALGraph;ALGraph6;//对彖6intLocateVek(ALGraph,char);intminimum(close);voidMinSpanTree_PRTM(ALGraph,char);voidCreate(ALGraph&);intmain(){chara;inti=l;Create(G);/*for(inti=l;i<=G・vexnum;i++){for(s=[i]・firstarc;s!二NUI丄;s二s->nextarc)cout«[i].data<〈"—"<〈[s->adjvex].data<</z====z,<<s->info«endl;}*/whiled){cout«,/输入起点:“;cin>>a;MinSpanTreePRIM(G,a);cout«,z如果结束输入'O',否则输入’1':〃;cin>>i;}return0;)intLocateVek(ALGraphG,charu){inti;for(i=l;i<=G・vexnum;i++)if(u==[i].data)returni:rcturnT;}intminimum(closem){inti=0,j,n=200;for(i=l;i<=G・vexnum;i++)if(m[i]<lowcost<n&&m[i].lowcost!=0){n=m[i]・lowcost;••J=l;}rcturnj;}voidMinSpanTree_PRlM(ALGraphG,charu){intj,k,a;closeclosedge;ode*s,*p,*q;for(j=l;j<=MAX_VERTEX_NUM;j++)closedgc[j]・lowcost二MAX;k=LocateVek(G,u);for(j=l;j<=