《數(shù)據(jù)結(jié)構(gòu)》課程設(shè)計(jì) 普里姆算法 最小生成樹(shù)

E-niail:E-niail:caiil@#2021-5-13FILE*fp;if((fp=fopen(Mmfo.txtM,Mrn))==NULL){printf(M\nTinsfilecannotbeopenedH);exit(0);}while(!feof(fp)){foi{j=i+lj<12j++){fscanf(fp,n%dH.&mfo[i]|j]);}i++；}fclose(fp);嚴(yán)普里姆算法主函數(shù)*/嚴(yán)普里姆算法主函數(shù)*/voidpriiu(GiaphMatnx*pgiaph.Edgelee[]){iiitijniin,vx，vy;mtweight,niniweight;Edgeedge;fbr(i=O;i<pgraph->n-l;i++){lge[i].start_vex=O:Ige[i]?stop_vex=i+1;lge[i].weight=pgraph->arcs[O][i+1];}fbr(i=O;i<pgraph->n-l;i++){niHiweight=MAX;j<pgraph->n-l；j++)if(lge[j].weight<niHiweight){niHiweight=lge[j].weight;}edge=lge[niui];lge[nun]=lge[i];lge[i]=edge;vx=lge[1]?stop_vex;foi(j=i+l；j<pgraph->n-l;j++){vy=lge[j]?stop_vex;weight=pgiaph->arcs[y^x][vy];if(weight<lse[j].weight){lge[j].weight=weight;lge[j].sta【t_\wx=vx;}}}}JvoidniainQmti;mtj=0,k;intp,q；mtgd=DETECT,gm;GrapliNIatiixgraph;mitgraph(&gd.&gm「d:\\TURBOC”);read_dataO；/*讀入數(shù)據(jù)*/iiiitalGraph(vex);/*圖形初始化*7for(j=0;j<12j++)fbi(k=0;k<12；k++)graph.arcs[j][k]=Hifo[j][k];/*把mfo數(shù)組每邊的權(quán)值附到圖中g(shù)iaph.n=12;pnm(&graphjge);fbi(i=O;i<graph.n-1;i++)printf(M(%d%d%d)\iiHJge[i].stail_vexJge[i].stop_vexjge[i].weight);/*盛出N?1條最小邊的信息*7fbr(i=0;i<12;i++){lme(vex[lge[i]?start_vex][0],vex[lge[i].start__vex][1],vex[lge[1]?stop_vex][0].vex[lee[i].stop^vex][1]);}嚴(yán)根據(jù)生成的最小邊數(shù)組連線(xiàn)3?Vprintf(M…Itisdone!一-getchQ;exit(l);}此程序再TURBOC2.0環(huán)境中編譯通過(guò)運(yùn)行.TURBOC2.0卜?載的地址http://monimg.iynu.edii.ca;downloads/tc2.rar四.收獲與體會(huì)盡管在大一學(xué)C的時(shí)候也做圖形界面的程序，但是經(jīng)過(guò)很長(zhǎng)時(shí)間沒(méi)有去用他,發(fā)現(xiàn)自己已經(jīng)不是很熟悉了?這次的設(shè)計(jì)我乂重新學(xué)習(xí)了C環(huán)境下圖形函數(shù)的使用?在用普里姆算法做最小生成樹(shù)的時(shí)候在不太理解的情況下乂重新仔細(xì)的按照課本上的原理，充分研究了mst性質(zhì).并最終寫(xiě)出了Pmn算法.所以說(shuō)每