邻接矩阵建立图已经遍历

#include<iostream>//广度遍历的队列实现
#include<queue>
using namespace std;
const int MaxSize=10;
int visited[10]= {0};
int visited1[10]={0};


template<class DataType>
class MGraph
{
private:
    DataType vertex[MaxSize];
    int arc[MaxSize][MaxSize];
    int vertexNum,arcNum;
public:
    MGraph(DataType a[],int n,int e)
    {
        vertexNum=n;
        arcNum=e;
        for(int i=0; i<vertexNum; i++)vertex[i]=a[i];
        for(int i=0; i<vertexNum; i++)
        {
            for(int j=0; j<vertexNum; j++)arc[i][j]=0;
        }
        int i,j;
        for(int k=0; k<arcNum; k++)
        {
            cin>>i>>j;
            arc[i][j]=1;
            arc[j][i]=1;
        }
    }

    void DFSTraverse(int v)
    {
        cout<<vertex[v];
        visited[v]=1;
        for(int j=0; j<vertexNum; j++)
        {
            if(arc[v][j]==1&&visited[j]==0)DFSTraverse(j);
        }
    }


    void BFSTraverse(int v)
    {
        queue<int> Q;
        cout<<vertex[v];
        visited1[v]=1;
        Q.push(v);//访问顶点入栈记得队列里面的出入栈是要用函数的
        while(Q.size()!=0)
        {
            //cout<<"size:"<<Q.size()<<endl;
           v=Q.front();//将队头出列
           Q.pop();
           for(int j=0;j<vertexNum;j++)
           {
               if(arc[v][j]==1&&visited1[j]==0)
               {
                   cout<<vertex[j];
                   visited1[j]=1;
                   Q.push(j);//入队
               }
           }
        }
    }
};

int main()
{
    char b[]={"abcdefgh"};
    MGraph<char> a(b,8,9);
    a.DFSTraverse(0);
    cout<<endl;
    a.BFSTraverse(0);
    return 0;
}