实验六：图的邻接矩阵存储方式（无向图）

源程序：

# include<iostream>

using namespace std;

const int MAXSIZE=10;

int visited[MAXSIZE]={0};

class MGraph

{

public:

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

    ~MGraph(){}

    void DFSTraverse(int v);

    void BFSTraverse(int v);

    void Print(int v);

    void PrintV();

private:

    char vertex[MAXSIZE];

    int arc[MAXSIZE][MAXSIZE];

     int vertexNum,arcNum;

};

MGraph::MGraph(char a[],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<<"