实验六：图



#include<iostream.h>

const int MaxSize=10;

int visited[MaxSize]={0};

class MGraph

{

public:

        MGraph(chara[],int n,int e);

        ~MGraph(){}

        voidDFSTraverse(int v);

   void BFSTraverse(int v);

private:

        intvertex[MaxSize];

        intarc[MaxSize][MaxSize];

        intvertexNum,arcNum;

};

MGraph::MGraph(char a[],int n,int e)

{

        inti,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;

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

        cin>>i>>j;

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

        {

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

        }

}

void MGraph::DFSTraverse(int v)

{

        intj;

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

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

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

}

void MGraph::BFSTraverse(int v)

{

        intj;+98

        intQ[MaxSize];

        intfront=-1;int rear=-1;

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

        while(front!=rear)

        {

                 v=Q[++front];

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

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

                         {

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

                         }

        }

}

int main()

{

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

        MGraphMG(ch,5,6);

        for(inti=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;

        return0;

}