그림 의 깊이 우선 이동 (DFS)

#define MaxSize 5
#define INF 100

//   
typedef struct ArcNode{
     
    int adjvex;
    struct ArcNode* nextArc;
}ArcNode;

typedef struct{
     
    char data;
    ArcNode* firstArc;
}VNode;

typedef struct{
     
    VNode adjList[MaxSize];
    int n;
    int e;
}AGraph;

int visit[MaxSize];

void initAGraph(AGraph* &G){
     
    G->e = 2;
    G->n = 3;
    cout<<"data:"<<endl;
    for (int i = 0; i < G->n; i++) {
     
        cin>>G->adjList[i].data;
        G->adjList[i].firstArc = NULL;
    }
    cout<<"vi,vj"<<endl;
    for (int j = 0; j < G->e; j++) {
     
        int vi,vj;
        cin>>vi>>vj;
        ArcNode* node = new ArcNode();
        node->adjvex = vj;
        node->nextArc = G->adjList[vi].firstArc;
        G->adjList[vi].firstArc = node;
    }
}

void DFS(AGraph *G,int v){
     
    ArcNode *p;
    visit[v] = 1;
    cout<<"current:"<<G->adjList[v].data<<endl;
    p = G->adjList[v].firstArc;
    while (p != NULL) {
     
        if (visit[p->adjvex] == 0) {
     
            DFS(G, p->adjvex);
            p = p->nextArc;
        }
    }
}

int main(int argc, const char * argv[]) {
     
    AGraph* G = new AGraph();
    initAGraph(G);
    for (int i = 0; i < G->e; i++) {
     
        if (visit[i] == 0) {
     
            DFS(G, i);
        }
    }
    return 0;
}