PAT (Advanced Level) Practice A1013 Battle Over Cities （25 分）(甲级)（C++）（图、DFS）

本文链接：https://blog.csdn.net/m0_37454852/article/details/87903399

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include <ctime>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;

const int MAX = 1010;
int N, M, K, city1, city2, invade;
bool Graph[MAX][MAX] = {{0}};//用邻接矩阵表示各城市间是否有公路

void DFS(bool G[][MAX], bool visited[], int v)//从v开始深搜；数组的传递相当于是指针的传递
{
    visited[v] = 1;
    for(int i=1; i<=N; i++)
    {
        if(!visited[i] && G[v][i])
        {
            visited[i] = 1;
            DFS(G, visited, i);
        }
    }
}

int DFSTraverse(int v)
{
    bool G[MAX][MAX];
    for(int i=1; i<=N; i++)//把原地图复制下来
        for(int j=1; j<=N; j++)
            G[i][j] = Graph[i][j];
    for(int i=1; i<=N; i++)//把与入侵城市相关的公路全部破坏掉
        G[v][i] = G[i][v] = 0;
    int cnt = 0;//cnt用来计数独立的城市群个数
    bool visited[MAX] = {0};
    for(int i=1; i<=N; i++)
    {
        if(!visited[i])
        {
            DFS(G, visited, i);
            cnt++;
        }
    }
    return cnt;
}

int main()
{
    scanf("%d %d %d", &N, &M, &K);
    for(int i=0; i<M; i++)
    {
        scanf("%d %d", &city1, &city2);
        Graph[city1][city2] = 1;
        Graph[city2][city1] = 1;
    }
    for(int i=0; i<K; i++)
    {
        scanf("%d", &invade);
        printf("%d\n", DFSTraverse(invade)-2);//需要新建的公路个数即独立城市群个数-2
    }
    return 0;
}