数据结构实验报告图实验docx.docx

1、数据结构实验报告图实验docx 图实验一， 邻接矩阵的实现1. 实验目的（1） 掌握图的逻辑结构（2） 掌握图的邻接矩阵的存储结构（3） 验证图的邻接矩阵存储及其遍历操作的实现2. 实验内容（1） 建立无向图的邻接矩阵存储（2） 进行深度优先遍历（3） 进行广度优先遍历3设计与编码MGraph.h#ifndef MGraph_H#define MGraph_Hconst int MaxSize = 10;templateclass MGraphpublic: MGraph(DataType a, int n, int e); MGraph() void DFSTraverse(int v);

2、void BFSTraverse(int v);private: DataType vertexMaxSize; int arcMaxSizeMaxSize; int vertexNum, arcNum;#endifMGraph.cpp#includeusing namespace std;#include MGraph.hextern int visitedMaxSize;templateMGraph:MGraph(DataType a, int n, int e) int i, j, k; vertexNum = n, arcNum = e; for(i = 0; i vertexNum;

3、 i+) vertexi = ai; for(i = 0;i vertexNum; i+) for(j = 0; j vertexNum; j+) arcij = 0; for(k = 0; k arcNum; k+) cout i j; arcij = 1; arcji = 1; templatevoid MGraph:DFSTraverse(int v) cout vertexv; visitedv = 1; for(int j = 0; j vertexNum; j+) if(arcvj = 1 & visitedj = 0) DFSTraverse(j);templatevoid MG

4、raph: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; visitedj = 1; Q+rear = j; MGraph_main.cpp#includeusing namespace std;#include MGraph.he

5、xtern int visitedMaxSize;templateMGraph: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 i j; arcij = 1; arcji = 1; templatevoid MGraph:DF

6、STraverse(int v) cout vertexv; visitedv = 1; for(int j = 0; j vertexNum; j+) if(arcvj = 1 & visitedj = 0) DFSTraverse(j);templatevoid MGraph: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

7、; j+) if(arcvj = 1 & visitedj = 0) cout vertexj; visitedj = 1; Q+rear = j; 4. 运行与测试5. 总结与心得通过该实验的代码编写与调试，熟悉了邻接矩阵在图结构中的应用，在调试过程中遇到很多的问题，在解决问题过程中也使我的写代码能力得到提升二， 邻接表的实现1. 实验目的（1） 掌握图的逻辑结构（2） 掌握图的邻接表存储结构（3） 验证图的邻接表存储及其遍历操作的实现2. 实验内容（1） 建立一个有向图的邻接表存储结构（2） 对建立的有向图进行深度优先遍历（3） 对建立的有向图进行广度优先遍历3. 设计与编码ALGraph

8、.h#ifndef ALGraph_H#define ALGraph_Hconst int MaxSize = 10;struct ArcNode int adjvex; ArcNode * next;templatestruct VertexNode DataType vertex; ArcNode * firstedge;templateclass ALGraphpublic: ALGraph(DataType a, int n, int e); ALGraph(); void DFSTraverse(int v); void BFSTraverse(int v);private: Ver

9、texNode adjlistMaxSize; int vertexNum, arcNum;#endifALGraph.cpp#includeusing namespace std;#includeALGraph.hextern int visitedMaxSize;templateALGraph:ALGraph(DataType a, int n, int e) ArcNode * s; int i, j, k; vertexNum = n; arcNum = e; for(i = 0; i vertexNum; i+) adjlisti.vertex = ai; adjlisti.firs

10、tedge = NULL; for(k = 0; k arcNum; k+) cout i j; s = new ArcNode; s-adjvex = j; s-next = adjlisti.firstedge; adjlisti.firstedge = s; templateALGraph:ALGraph() ArcNode * p = NULL; for(int i = 0; i next; delete p; p = adjlisti.firstedge; templatevoid ALGraph:DFSTraverse(int v) ArcNode * p = NULL; int

11、j; cout adjvex; if(visitedj = 0) DFSTraverse(j); p = p-next; templatevoid ALGraph:BFSTraverse(int v) int QMaxSize; int front = -1, rear = -1; ArcNode * p = NULL; cout adjvex; if(visitedj = 0) cout next; ALGraph_main.cpp#includeusing namespace std;#includeALGraph.cppint visitedMaxSize = 0;int main()

12、char ch = A,B,C,D,E; int i; ALGraph ALG(ch, 5, 6); for(i = 0; i MaxSize; i+) visitedi = 0; cout Depth-first traverse sequence is: ; ALG.DFSTraverse(0); cout endl; for(i = 0; i MaxSize; i+) visitedi = 0; cout Breadth-first traverse sequence is: ; ALG.BFSTraverse(0); cout endl; return 0;4. 运行与调试5. 总结与心得通过该实验，掌握了图的邻接表存储结构