數(shù)據(jù)結(jié)構(gòu)實驗報告-圖實驗

1、圖實驗，鄰接矩陣的實現(xiàn)1.實驗?zāi)康模?）掌握圖的邏輯結(jié)構(gòu)（2）掌握圖的鄰接矩陣的存儲結(jié)構(gòu)（3）驗證圖的鄰接矩陣存儲及其遍歷操作的實現(xiàn)2.實驗內(nèi)容（1）建立無向圖的鄰接矩陣存儲（2）進行深度優(yōu)先遍歷（3）進行廣度優(yōu)先遍歷3設(shè)計與編碼MGraph.h#ifndefMGraph_H#defineMGraph_HconstintMaxSize=10;templateclassMGraphpublic:MGraph（DataTypea,intn,inte）;MGraph（）voidDFSTraverse（intv）;voidBFSTraverse（intv）;private:DataTypevertex

2、MaxSize;intarcMaxSizeMaxSize;intvertexNum,arcNum;#endifMGraph.cpp#includeusingnamespacestd;#includeMGraph.hexternintvisitedMaxSize;templateMGraph:MGraph（DataTypea,intn,inte）inti,j,k;vertexNum=n,arcNum=e;for(i=0;ivertexNum;i+)vertexi=ai;for(i=0;ivertexNum;i+)for(j=0;jvertexNum;j+)arcij=0;for(k=0;karc

3、Num;k+)coutij;arcij=1;arcji=1;templatevoidMGraph:DFSTraverse(intv)coutvertexv;visitedv=1;for(intj=0;jvertexNum;j+)if(arcvj=1&visitedj=0)DFSTraverse(j);templatevoidMGraph:BFSTraverse(intv)intQMaxSize;intfront=-1,rear=-1;coutvertexv;visitedv=1;Q+rear=v;while(front!=rear)v=Q+front;for(intj=0;jvertexNum

4、;j+)if(arcvj=1&visitedj=0)coutvertexj;visitedj=1;Q+rear=j;MGraph_main.cpp#includeusingnamespacestd;#includeMGraph.hexternintvisitedMaxSize;templateMGraph:MGraph(DataTypea,intn,inte)inti,j,k;vertexNum=n,arcNum=e;for(i=0;ivertexNum;i+)vertexi=ai;for(i=0;ivertexNum;i+)for(j=0;jvertexNum;j+)arcij=0;for(

5、k=0;karcNum;k+)coutij;arcij=1;arcji=1;templatevoidMGraph:DFSTraverse(intv)coutvertexv;visitedv=1;for(intj=0;jvertexNum;j+)if(arcvj=1&visitedj=0)DFSTraverse(j);templatevoidMGraph:BFSTraverse(intv)intQMaxSize;intfront=-1,rear=-1;coutvertexv;visitedv=1;Q+rear=v;while(front!=rear)v=Q+front;for(intj=0;jv

6、ertexNum;j+)if(arcvj=1&visitedj=0)coutvertexj;visitedj=1;Q+rear=j;4.運行與測試5.總結(jié)與心得通過該實驗的代碼編寫與調(diào)試，熟悉了鄰接矩陣在圖結(jié)構(gòu)中的應(yīng)用，在調(diào)試過程中遇到很多的問題，在解決問題過程中也使我的寫代碼能力得到提升，鄰接表的實現(xiàn)1.實驗?zāi)康模?）掌握圖的邏輯結(jié)構(gòu)（2）掌握圖的鄰接表存儲結(jié)構(gòu)（3）驗證圖的鄰接表存儲及其遍歷操作的實現(xiàn)2.實驗內(nèi)容（1）建立一個有向圖的鄰接表存儲結(jié)構(gòu)（2）對建立的有向圖進行深度優(yōu)先遍歷（3）對建立的有向圖進行廣度優(yōu)先遍歷3.設(shè)計與編碼ALGraph.h#ifndefALGraph_H#def

7、ineALGraph_HconstintMaxSize=10;structArcNodeintadjvex;ArcNode*next;templatestructVertexNodeDataTypevertex;ArcNode*firstedge;templateclassALGraphpublic:ALGraph（DataTypea,intn,inte）;ALGraph（）;voidDFSTraverse（intv）;voidBFSTraverse（intv）;private:VertexNodeadjlistMaxSize;intvertexNum,arcNum;#endifALGraph

8、.cpp#includeusingnamespacestd;#includeALGraph.hexternintvisitedMaxSize;templateALGraph:ALGraph(DataTypea,intn,inte)ArcNode*s;inti,j,k;vertexNum=n;arcNum=e;for(i=0;ivertexNum;i+)adjlisti.vertex=ai;adjlisti.firstedge=NULL;for(k=0;karcNum;k+)coutij;s=newArcNode;s-adjvex=j;s-next=adjlisti.firstedge;adjl

9、isti.firstedge=s;templateALGraph:ALGraph()ArcNode*p=NULL;for(inti=0;inext;deletep;p=adjlisti.firstedge;templatevoidALGraph:DFSTraverse(intv)ArcNode*p=NULL;intj;coutadjvex;if(visitedj=0)DFSTraverse(j);p=p-next;templatevoidALGraph:BFSTraverse(intv)intQMaxSize;intfront=-1,rear=-1;ArcNode*p=NULL;coutadj

10、vex;if(visitedj=0)coutnext;ALGraph_main.cpp#includeusingnamespacestd;#includeALGraph.cppintvisitedMaxSize=0;intmain()charch=A,B,C,D,E;inti;ALGraphALG(ch,5,6);for(i=0;iMaxSize;i+)visitedi=0;coutDepth-firsttraversesequenceis:;ALG.DFSTraverse(0);coutendl;for(i=0;iMaxSize;i+)visitedi=0;coutBreadth-firsttraversesequenceis:;ALG.BFSTraverse(0);coutendl;return0;4.運行與調(diào)試34vertices-uertices-uertices：vertices：vertices：twotyotyotyotyoEntzi-ofofofofofrauFibernunbsrnunbBFnunbsrnunbarcfofofofofthethethethetheProcessexitedwitJipetutnvalue兇Pressanykeytocontinue.setittlserialserialserialserialritasi