1、#include#includeusingnamespacestd;#defineINFINITY32767#defineMAX_VEX50#defineOK1#defineFALSE0#defineTRUE1#defineERROR-1bool*visited;圖的鄰接矩陣存儲(chǔ)結(jié)構(gòu)typedefstructchar*vexs;動(dòng)態(tài)分配空間存儲(chǔ)頂點(diǎn)向量intarcsMAX_VEXMAX_VEX;鄰接矩陣intvexnum,arcnum;圖的當(dāng)前定點(diǎn)數(shù)和弧數(shù)Graph;圖G中查找頂點(diǎn)c的位置intLocateVex(GraphG,charc)for(inti=0;iG.vexnum;+i)if(

2、G.vexsi=c)returni;returnERROR;創(chuàng)建無(wú)向網(wǎng)voidCreatellDN(Graph&G)采用數(shù)組(鄰接矩陣)表示法，構(gòu)造無(wú)向圖Gcout請(qǐng)輸入定點(diǎn)數(shù)和弧數(shù)：；cinG.vexnumG.arcnum;cout請(qǐng)輸入G.vexnum個(gè)頂點(diǎn)endl;G.vexs=(char*)malloc(G.vexnum+l)*sizeof(char);需要開(kāi)辟多一個(gè)空間存儲(chǔ)0構(gòu)造頂點(diǎn)向量for(inti=0;iG.vexsi;G.vexsG.vexnum=、0;初始化鄰接矩陣for(inti=0;iG.vexnum;+i)for(intj=0;jG.vexnum;j+)G.arcsi

3、j=INFINITY;cout請(qǐng)輸入G.arcnum條弧endl;chara,b;intsi,s2;for(inti=0;iab;si=LocateVex(G,a);找到a和b在頂點(diǎn)向量中的位置s2=LocateVex(G,b);圖G中頂點(diǎn)k的第一個(gè)鄰接頂點(diǎn)intFirstVex(GraphGJntk)for(inti=0;iG.vexnum;+i)if(G.arcski!=INFINITY)returni;returnERROR;返回i(相對(duì)于j)的下一個(gè)鄰接頂點(diǎn)intNextVex(GraphGJntijntj)for(intk=j+1;k=0;w=NextVex(Gzv,w)if(!visitedw)DFS(G,w);深度優(yōu)先遍歷voidDFSTraverse(GraphG,inti)for(intj=0;jG.vexnum;+j)初始化所有的頂點(diǎn)狀態(tài)為未被訪問(wèn)visitedfj=FALSE;遍歷結(jié)點(diǎn)for(;iG.vexnum;+i)if(!visitedi)DFS(GJ);主函數(shù)intmain()GraphG;CreateUDN(G);visited=(bool*)malloc(G.vex