C++ DFS BFS

#include <iostream>#define MaxVertices 8using namespace std;struct EdgeNode{    int adjvex;    int weight;    EdgeNode *next;};class Graph{private:    EdgeNode *GL[MaxVertices];    int numberVertices;public:    Graph():numberVertices(0){    for(int i=0;i<MaxVertices;i++)    GL[i]=NULL;}    void CreateEdge(int k1,int k2);    void CreateVertices(int n);    void dfsAdjoin(int i,bool* visited);    void dfsTraverse();    void bfsAdjoin(int i,bool* visited);    void bfsTraverse();};void Graph:: CreateVertices(int k1,int k2){    char c1,c2,c3;    int i,j;    int w;    EdgeNode* p;    cout<<"请输入边形式为{(),()}";    cin>>c1;    if(k2==0)    {    }}int main(){}