6-14 Count Connected Components (20 分)

int vis[MaxVertexNum]={0};
void DFS(LGraph Graph,int v){
    vis[v]=1;
    PtrToAdjVNode p=Graph->G[v].FirstEdge;
    while(p){
        if(vis[p->AdjV]==0){
            DFS(Graph,p->AdjV);
        }
        p=p->Next;
    }
}

int CountConnectedComponents( LGraph Graph ){
    int k=0;
    for(int i=0;i<Graph->Nv;i++){
        if(vis[i]==0){
            DFS(Graph,i);
            k++;
        }
    }
    return k;
}