PAT A1013 DFS使用邻接矩阵

只需要设置current_point表示当前删除的结点，置vis[current_point]=true即可。其他套模板

#include <iostream>
#include <algorithm>
using namespace std;
const int MAXV = 1010;
const int INF = 0x3fffffff;

int G[MAXV][MAXV];
bool vis[MAXV] = {false};
int n, m, K, current_point;
int cnt = 0;
void DFS(int u) {
  vis[u] = true;
  for (int v = 1; v <= n; ++v) {
    if (!vis[v] && G[u][v] != INF) {
      DFS(v);
    }
  }
}

void DFSTrave() {
  vis[current_point] = true;
  cnt = 0;
  for (int u = 1; u <= n; ++u) {
    if (!vis[u] && u != current_point) {
      DFS(u);
      cnt++;
    }
  }
}

int main() {
  //freopen(R"(D:\CS\C++Projects\PAT_ALevelFromClion\input.txt)","r",stdin);
  fill(G[0], G[0] + MAXV * MAXV, INF);
  cin >> n >> m >> K;
  for (int i = 0; i < m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u][v] = G[v][u] = 1;
  }
  for (int i = 0; i < K; ++i) {
    fill(vis, vis + MAXV, false);
    scanf("%d", &current_point);
    DFSTrave();
    printf("%d\n", cnt - 1);
  }
  return 0;
}