C++実装図の隣接行列の作成とその深さ優先遍歴と広さ優先遍歴

#include
using namespace std;
typedef char vertextype;
typedef int edgetype;
#define maxvex 100
#define infinity 1000
#include
int visited[100];

class MGraph{
	
public:
	vertextype vexs[maxvex];
	edgetype arc[maxvex][maxvex];
	int numvertexs,numedges;//             
	MGraph(const int &v,const int &e):numvertexs(v),numedges(e){}
	void creategraph();//     
	void displaygraph();//      
	void DFS(int i);//          
	void DFSTraverse();
	void BFSTraverse();//        



};
void MGraph::creategraph()
{  cout<>vexs[i];
	}
	cin.clear();
	cout<>arc[i][j];
		}
	}
	

}
void MGraph::displaygraph()
{   cout< q;
	for(i=0;i