```c++ bool Visited[n + 1]; for(int i = 1; i <= n; i++){ Visited[i] = 0; } //从顶点k出发进行深度优先搜索 void Dfsk(int k){ Visited[k] = 1; for(int j = 1; j <= n; j++){ if(c[k][j] == 1 && Visited[j] == 0){ Dfsk(j); } } } //深度优先搜索整个图 void Dfs(){ for(int i = 1; i <= n; i++){ if(Visited[i] == 0){ Dfsk(i); } } } ```