数据结构图的基本运算

}
}
}
template<class T>
void MGraph<T>::DFS(ied[v]=true;
cout<<" "<<v;
for(int j=0;j<n;j++)
if(a[v][j]!=noEdge&&!visited[j])
DFS(j,visited);
int front ,rear; int maxSize; T *q; }; template<class T> SeqQueue<T>::SeqQueue(int mSize) { maxSize=mSize; q=new T[maxSize]; front=rear=0; } template<class T> bool SeqQueue<T>::Front(T &x)const { if(IsEmpty()){ cout<<"Empty"<<endl; return false; }
cout<<"Undetflow"<<endl;return false; } front=(front+1)%maxSize; return true; } 2. 邻接矩阵 .h 头文件 #include<iostream> using namespace std; enum ResultCode {Overflow,Underflow,Success,Failure,Dulplicate,NotPresent}; template<class T> class Graph { public: virtual ResultCode Insert(int u,int v,T &w)=0; virtual ResultCode Remove(int u,int v)=0; virtual bool Exist(int u,int v)const=0;
virtual int Vertices()const{return n;} protected: int n,e; }; template<class T> class MGraph:public Graph<T> { public: MGraph(int mSize,const T &noedg); ~MGraph(); ResultCode Insert(int u,int v,T &w); ResultCode Remove(int u,int v); bool Exist(int u,int v)const; void Visit() { for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) cout<<a[i][j]<<" "; cout<<endl; } } void BFS(); void DFS(); protected: T **a; T noEdge; void BFS(int v,bool *visited); void DFS(int v,bool *visited); }; template<class T> void MGraph<T>::BFS() { bool *visited=new bool[n];
for(int i=0;i<n;i++) visited[i]=false; for(i=0;i<n;i++) if(!visited[i]) BFS(i,visited); delete []visited; } template<class T> void MGraph<T>::DFS() { bool *visited=new bool[n]; for(int i=0;i<n;i++) visited[i]=false; for(i=0;i<n;i++) if(!visited[i]) DFS(i,visited); delete []visited;
} template<class T> void MGraph<T>::BFS(int v,bool *visited) { SeqQueue<int> q(n); visited[v]=true; cout<<" "<<v; q.EnQueue(v); while(!q.IsEmpty()) { q.Front(v); q.DeQueue(); for(int i=0;i<n;i++) if(a[v][i]!=noEdge && !visited[i]) { visited[i]=true; cout<<" "<<i; q.EnQueue(i);
图的基本运算
1.SeqQueue.h 头文件 : #include<iostream> using namespace std; template<class T> class SeqQueue { 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:
x=q[(front+1)%maxSize]; return true; } template<class T> bool SeqQueue<T>::EnQueue(T x) { if(IsFull()){ cout<<"Full"<<endl;return false; } rear=(rear+1)%maxSize; q[rear]=x; return true; } template<class T> bool SeqQueue<T>::DeQueue() { if(IsEmpty()){