Data Structures and Algorithms (English) - 6-14 Count Connected Components（20 分）

intvis[MaxVertexNum];
voiddfs(LGraphGraph, intv)
{
vis[v]=1;
PtrToAdjVNodep=Graph->G[v].FirstEdge;
while(p)
    {
inti=p->AdjV;
if(!vis[i]) dfs(Graph,i);
p=p->Next;
    }
}
intCountConnectedComponents( LGraphGraph )
{
intcnt=0;
for(inti=0;i<Graph->Nv;i++) vis[i]=0;
for(inti=0;i<Graph->Nv;i++)
if(!vis[i])
        {
dfs(Graph,i);
cnt++;
        }
returncnt;
}