無向圖的連通分量統(tǒng)計(jì)(數(shù)組)

《無向圖的連通分量統(tǒng)計(jì)(數(shù)組)》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)。

1、#include#includeusingnamespacestd;#defineINFINITY0//最大值為無限大#defineMAX_VERTEX_NUM20//最大頂點(diǎn)個(gè)數(shù)boolvisited[MAX_VERTEX_NUM]={false};//數(shù)組的遍歷標(biāo)志//typedefenum{DG,DN,UDG,UDN}GraphKind;//{有向圖，有向網(wǎng)，無向圖，無向網(wǎng)}typedefstructArcCell{intadj;//對(duì)無權(quán)圖，用1或0表示是否相鄰;對(duì)帶權(quán)圖，則為權(quán)值int*info;//邊的信息}ArcCel

2、l,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];typedefstruct{intvexs[MAX_VERTEX_NUM];//頂點(diǎn)向量AdjMatrixarcs;//鄰接矩陣intvexnum,arcnum;//圖的當(dāng)前頂點(diǎn)數(shù)和弧數(shù)intkind;//圖的類型}MGraph;intCreateUDN(MGraph&G){cout<<"請(qǐng)輸入頂點(diǎn)個(gè)數(shù)和弧數(shù):";cin>>G.vexnum>>G.arcnum;inti;for(i=0;i

3、i++){for(intj=0;j>v1>>v2>>w;G.arcs[v1-1][v2-1].adj=w;G.arcs[v2-1][v1-1].adj=w;}return1;}intCreateUDG(MGraph&G){cout<<"請(qǐng)輸入頂點(diǎn)個(gè)數(shù)和弧數(shù):";cin>>G.vexnum>>G.arcnum;inti;fo

4、r(i=0;i>v1>>v2>>w;G.arcs[v1-1][v2-1].adj=w;G.arcs[v2-1][v1-1].adj=w;}return1;}intCreateDN(MGraph&G

5、){cout<<"請(qǐng)輸入頂點(diǎn)個(gè)數(shù)和弧數(shù):";cin>>G.vexnum>>G.arcnum;inti;for(i=0;i>v1>>v2>>w;G.arcs[v1-1][v2-1].adj=w;}r

6、eturn1;}intCreateDG(MGraph&G){cout<<"請(qǐng)輸入頂點(diǎn)個(gè)數(shù)和弧數(shù):";cin>>G.vexnum>>G.arcnum;inti;for(i=0;i>v1>>v2>>w

7、;G.arcs[v1-1][v2-1].adj=w;}return1;}intCreateGraph(MGraph&G){cout<<"請(qǐng)輸入你想要的圖的類型：";cin>>G.kind;switch(G.kind){case0:returnCreateDG(G);//構(gòu)造有向圖case1:returnCreateDN(G);//構(gòu)造有向網(wǎng)case2:returnCreateUDG(G);//構(gòu)造無向圖case3:returnCreateUDN(G);//構(gòu)造無向網(wǎng)default:return0;}}intFirstAdjVex(MGraph&G,i