[数据结构实验三.docxVIP

图的基本运算：问题描述邻接矩阵和邻接表两种不同存储结构上实现图的基本运算的算法。在邻接矩阵存储结构上实现图的深度和宽度优先遍历算法。二、系统分析和概要设计实现了Graph,SeqQueue,结点类ENode,邻接矩阵类MGraph,邻接表LGraph类，包括几种为不同传入类型准备的构造函数。声明所要求的函数，并在后续过程中实现函数功能，最后通过一个main函数求解。三、详细设计1. 类和类的层次结构Graph类public:virtual ResultCode Insert(int u, int v, Tw) = 0;virtual ResultCode Remove(int u, int v) = 0;virtual bool Exist(int u, int v)const = 0;protected:int n, e;SeqQueue类 MGraph类public:SeqQueue(int mSize);~SeqQueue() { delete[]q; }bool IsEmpty() const { return front == rear; }bool IsFull() const { return (rear + 1) % maxSize == front; }bool Front(T x)const;bool EnQueue(T x);bool DeQueue();void Clear() { front = rear = 0; }private:int front, rear;int maxSize;T*q;public:MGraph(int mSize, const T noedg);~MGraph();ResultCode Insert(int u, int v, Tw);ResultCode Remove(int u, int v);bool Exist(int u, int v)const;void DFS();void BFS();protected:T**a;T noEdge;void DFS(int v, bool*visited);void BFS(int v, bool*visited);ENode类LGraph类public:ENode() { nextArc = NULL; }ENode(int vertex, T weight, ENode *next){adjVex = vertex;w = weight;nextArc = next;}int adjVex;T w;ENode *nextArc;public:LGraph(int mSize);~LGraph();ResultCode Insert(int u, int v, Tw);ResultCode Remove(int u, int v);bool Exist(int u, int v)const;protected:ENodeT**a;2. 核心算法①深度遍历template class T void MGraphT::DFS() //深度遍历{ bool *visited=new bool[n]; for (int i=0;in;i++) visited[i]=false; for(i=0;in;i++) if(!visited[i]) DFS(i,visited); delete[]visited; } template class T void MGraphT::DFS(int v,bool *visited) { visited[v]=true; cout v; for(int i=0;in;i++) if(a[v][i]!=noEdgea[v][i]!=0!visited[i]) DFS(i,visited); } ②广度遍历template class T void MGraphT::BFS() //广度遍历{ bool *visited=new bool[n]; for (int i=0;in;i++) visited[i]=false; for(i=0;in;i++) if(!visited[i]) BFS(i,visited); delete[]visited; } template class T void MGraphT::BFS(int v,bool *visited) { SeqQueu