1、class DataTypeclass MGraphpublic: MGraph(DataType a, int n, int e); MGraph() void DFSTraverse(int v); void BFSTraverse(int v);private: DataType vertexMaxSize; int arcMaxSizeMaxSize; int vertexNum, arcNum;#endifMGraph.cpp#includeusing namespace std;#include MGraph.hextern int visitedMaxSize;MGraph:MG
2、raph(DataType a, int n, int e) int i, j, k; vertexNum = n, arcNum = e; for(i = 0; i vertexNum; i+) vertexi = ai;i for(j = 0; j j+) arcij = 0; for(k = 0; k arcNum; k+) cout i j; arcij = 1; arcji = 1;void MGraphDFSTraverse(int v) cout vertexv; visitedv = 1; for(int j = 0; if(arcvj = 1 & visitedj = 0)
3、DFSTraverse(j);BFSTraverse(int v) int QMaxSize; int front = -1, rear = -1; Q+rear = v; while(front != rear) v = Q+front; for(int j = 0;j if(arcvj = 1 & visitedj = 0) cout vertexj; visitedj = 1; Q+rear = j; MGraph_main.cpp4.运行与测试5.总结与心得通过该实验的代码编写与调试,熟悉了邻接矩阵在图结构中的应用,在调试过程中遇到很多的问题,在解决问题过程中也使我的写代码能力得到提升
4、二,邻接表的实现(2)掌握图的邻接表存储结构(3)验证图的邻接表存储及其遍历操作的实现(1)建立一个有向图的邻接表存储结构(2)对建立的有向图进行深度优先遍历(3)对建立的有向图进行广度优先遍历3.设计与编码ALGraph.h#ifndef ALGraph_H#define ALGraph_Hstruct ArcNode int adjvex; ArcNode * next;struct VertexNode DataType vertex; ArcNode * firstedge;class ALGraph ALGraph(DataType a, int n, int e); ALGraph
5、(); VertexNode adjlistMaxSize;ALGraph.cpp#includeALGraph.hALGraphadjvex = j; s-next = adjlisti.firstedge; adjlisti.firstedge = s;ALGraph() ArcNode * p = NULL; for(int i = 0; p = adjlisti.firstedge; while(p != NULL) adjlisti.firstedge = p-next; delete p; p = adjlisti.firstedge; void ALGraphadjvex; if
6、(visitedj = 0) DFSTraverse(j); p = p- p = adjlistv.firstedge; int j = p- if(visitedj = 0) adjlistj.vertex; visitedj = 1; Q+rear = j; p = p-ALGraph_main.cppALGraph.cppint visitedMaxSize = 0;int main() char ch = A,BCDE int i; ALGraph ALG(ch, 5, 6); MaxSize; visitedi = 0;Depth-first traverse sequence is: ALG.DFSTraverse(0); endl;Breadth-first traverse sequence is: ALG.BFSTraverse(0); return 0;4.运行与调试通过该实验,掌握了图的邻接表存储结构
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1