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

1、謝謝你的觀賞鄰接矩陣的實現(xiàn)1 .實驗?zāi)康?1)掌握圖的邏輯結(jié)構(gòu)(2)掌握圖的鄰接矩陣的存儲結(jié)構(gòu)(3)驗證圖的鄰接矩陣存儲及其遍歷操作的實現(xiàn)2 .實驗內(nèi)容(1)建立無向圖的鄰接矩陣存儲(2)進(jìn)行深度優(yōu)先遍歷(3)進(jìn)行廣度優(yōu)先遍歷3 .設(shè)計與編碼MGraph.h#ifndef MGraph_H#define MGraph_Hconst int MaxSize = 10;template<class DataType>class MGraphpublic:MGraph(DataType a, int n, int e);MGraph()void DFSTraverse(int v);vo

2、id BFSTraverse(int v);private:DataType vertexMaxSize;int arcMaxSizeMaxSize;int vertexNum, arcNum;；#endifMGraph.cpp#include<iostream>using namespace std;#include "MGraph.h"extern int visitedMaxSize;template<class DataType>MGraph<DataType>:MGraph(DataType a, int n, int e) i

3、nt i, j, k;vertexNum = n, arcNum = e;for(i = 0; i < vertexNum; i+)vertexi = ai;for(i = 0;i < vertexNum; i+)for(j = 0; j < vertexNum; j+)arcij = 0；for(k = 0; k < arcNum; k+)cout << "Please enter two vertexs number of edge:"cin >> i >> j;arcij = 1;arcji = 1;temp

4、late<class DataType>void MGraph<DataType>:DFSTraverse(int v)cout << vertexv;visitedv = 1;for(int j = 0; j < vertexNum; j+)if(arcvj = 1 && visitedj = 0)DFSTraverse(j);template<class DataType>void MGraph<DataType>:BFSTraverse(int v)int QMaxSize;int front = -1,

5、rear = -1;cout << vertexv;visitedv = 1;Q+rear = v;whilefront != rear)v = Q+front;for(int j = 0;j < vertexNum; j+)if(arcvj = 1 && visitedj = 0) cout << vertexj;visitedj = 1;Q+rear = j;MGraph_main.cpp#include<iostream>using namespace std;#include "MGraph.h"extern

6、 int visitedMaxSize;template<class DataType>MGraph<DataType>:MGraph(DataType a, int n, int e)int i, j, k；vertexNum = n, arcNum = e;for(i = 0; i < vertexNum; i+)vertexi = ai;for(i = 0;i < vertexNum; i+)for(j = 0; j < vertexNum; j+)arcij = 0;for(k = 0; k < arcNum; k+)cout <&

7、lt; "Please enter two vertexs number of edge:" cin >> i >> j;arcij = 1;arcji = 1;template<class DataType>void MGraph<DataType>:DFSTraverse(int v)cout << vertexv;visitedv = 1;謝謝你的觀賞for(int j = 0; j < vertexNum; j+) if(arcvj = 1 && visited。 = 0)DFSTra

8、verse(j);template<class DataType>void MGraph<DataType>:BFSTraverse(int v)int QMaxSize;int front = -1, rear = -1;cout << vertexv;visitedv = 1;Q+rear = v;while(front != rear)v = Q+front;for(int j = 0;j < vertexNum; j+)if(arcvj = 1 && visitedj = 0) cout << vertexj;vis

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

10、truct ArcNodeint adjvex;ArcNode * next;；template<class DataType>struct VertexNodeDataType vertex;ArcNode * firstedge;；template<class DataType>class ALGraphpublic:ALGraph(DataType a, int n, int e);ALGraph();void DFSTraverse(int v);void BFSTraverse(int v);private:VertexNode<DataType>

11、 adjlistMaxSize;int vertexNum, arcNum;#endifALGraph.cpp#include<iostream>using namespace std;#include"ALGraph.h"extern int visitedMaxSize;template<class DataType>ALGraph<DataType>:ALGraph(DataType a, int n, int e)ArcNode * s;int i, j, k；vertexNum = n; arcNum = e;for(i = 0

12、; i < vertexNum; i+)adjlisti.vertex = ai;adjlisti.firstedge = NULL;for(k = 0; k < arcNum; k+)cout << "Please enter the edge of the serial number of two vertices:"cin >> i >> j;s = new ArcNode; s->adjvex = j;s->next = adjlisti.firstedge;adjlisti.firstedge = s;t

13、emplate<class DataType>ALGraph<DataType>:ALGraph()ArcNode * p = NULL;for(int i = 0; i < vertexNum; i+)p = adjlisti.firstedge;while(p != NULL)adjlisti.firstedge = p->next;delete p;p = adjlisti.firstedge;template<class DataType>void ALGraph<DataType>:DFSTraverse(int v) Ar

14、cNode * p = NULL; int j;cout << adjlistv.vertex;visitedv = 1;p = adjlistv.firstedge;while(p != NULL)j = p->adjvex;if(visitedj = 0) DFSTraverse(j);p = p->next;template<class DataType>void ALGraph<DataType>:BFSTraverse(int v)int QMaxSize;int front = -1, rear = -1;ArcNode * p =

15、NULL;cout << adjlistv.vertex; visitedv = 1; Q+rear= v;whilefront != rear)v = Q+front;p = adjlistv.firstedge;while(p != NULL)int j = p->adjvex;visitedj=1;if(visitedj = 0)cout << adjlistj.vertex;Q+rear = j;p = p->next;ALGraph_main.cpp#include<iostream>using namespace std;#include"ALGraph.cpp”int visitedMaxSize = 0;int main()char ch口 = 'A','B','C','D','E'int i;ALGraph<char> ALG(ch, 5, 6);for(i = 0; i < MaxSize; i+)visitedi = 0;cout << "Depth-first t