信管117116李可欣数据结构实验六

#ifndef MGraph_H

#define MGraph_H

const intMaxSize=10;

 

template<classDataType>

class MGraph

{

      public:

           MGraph(DataType a[],int n,int e);

           ~MGraph(){}

           void DFSTraverse(int v);

           void BFSTraverse(int v);

      private:

           DataType vertex[MaxSize];

           int arc[MaxSize][MaxSize];

           int vertexNum,arcNum;

};

#endif

 

 

#include<iostream>

using namespacestd;

#include"MGraph.h"

 

tempalte<classDataType>

MGraph<DataType>::MGraph(DataTypea[],int n,int e)

{

      int i,j,k;

      vertexNum=n;arcNum=e;

      for(i=0;i<vertexNum;i++)

           vertex[i]=a[i];

      for(i=0;i<vertexNum;i++)

           for(j=0;j<vertexNum;j++)

                 arc[i][j]=0;

           for(k=0;k<arcNum;k++)

           {

                 cout<<"请输入边的两个顶点的序号：";

                 cin>>i>>j;

                 arc[i][j]=1;arc[j][i]=1;

           }

}

 

template<classDataType>

voidMGraph<DataType>::DFSTraverse(int v)

{

      cout<<vertex[v];visited[v]=1;

      for(int j=0;j<vertexNum;j++)

           if(arc[v][j]==1&&visited[j]==0)

                 DESTraverse(j);

}

 

template<classDataType>

voidMGragh<DataType>::BFSTraverse(int v)

{

      int Q[MGraph];

      int front=-1,rear=-1;

      cout<<vertex[v];visited[v]=1;Q[++rear]=v;

      while(front!=rear)

      {

           v=Q[++front];

           for(int j=0;j<vertexNum;j++)

                 if(arc[v][j]==1&&visited[j]==0){

                      cout<<vertex[j];visited[j]=1;Q[++rear]=j;

                 }

      }

}

 

 

#include<iostream>

using namespacestd;

#include"MGraph.cpp"

intvisited[MaxSize]={0};

 

int main()

{

      char ch[]={'A','B','C','D','E'};

      MGraph<char>MG(ch,5,6);

      for(int i=0;i<MaxSize;i++)

           visited[i]=0;

      cout<<"深度优先的遍历序列是：";

      MG.DFSTraverse(0);

      cout<<endl;

      for(i=0;i<MaxSize;i++)

           visited[i]=0;

      cout<<"广度优先遍历序列是：";

      MG.BFSTraverse(0);

      cout<<endl;

      return 0;

}