邻接矩阵建立无向图

#include
using namespace std;
const int MaxSize=10;
class MGraph
{public:
MGraph(int n,int e){vertexNum=n;arcNum=e;
for(int i=0;i>x;vertex[i]=x;visited1[i]=0;visited2[i]=0;}
for(int z=0;z>a;cout<<"第二个顶点:";cin>>b;arc[a][b]=1;arc[b][a]=1;}}
void DFSTraverse(int v){cout<>a;
cout<<"边数:";int b;cin>>b;
MGraph M(a,b);
cout<<"深度优先遍历:";cout<<"选择第一个访问的顶点:";int top1;cin>>top1;M.DFSTraverse(top1);cout<>top2;M.BFSTraverse(top2);cout<