题目链接:PAT甲级1013
分析:添加的最少的路线,就是他们的连通分量数-1,因为当a个互相分立的连通分量需要变为连通图的时候,只需要添加a-1个路线,就能让他们相连。由于删除的城市单独为一个连通分量,所以就是他们的连通分量数-2,所以这道题就是求去除了某个结点之后其他的图所拥有的连通分量数cnt。
#include <stdio.h>
#include <string.h>
#include <string>
#include <algorithm>
using namespace std;
#include <vector>
#include <queue>
#include <fstream>
const int maxn = 1000;
int n;
bool inq[maxn] = { false };
vector<int> Adj[maxn];
int cnt = 0;
void BFS(vector<int> Adj[], int u)
{
queue<int> q;
q.push(u);
inq[u] = true;
while (!q.empty())
{
int u = q.front();
q.pop();
//while(Adj[u])
for (int i = 0; i < Adj[u].size(); i++)
{
if (inq[Adj[u][i]] == false)
{
q.push(Adj[u][i]);
inq[Adj[u][i]] = true;
}
}
}
}
void BFStrave(vector<int> Adj1[],int u)
{
vector<int> Adj[maxn];//Adj为Adj1的副本,防止对Adj1作出修改
for (int i = 1; i <= n; i++)
Adj[i] = Adj1[i];
Adj[u].clear();
for (int i = 1; i <= n; i++)
{
for (int j = 0; j < Adj[i].size(); j++)
{
if (Adj[i][j] == u)
{
Adj[i].erase(Adj[i].begin() + j);
//printf("%d", Adj[i].size());
break;
}
}
}
for (int i = 1; i <= n; i++)
{
if (inq[i] == false)
{
BFS(Adj,i);
cnt++;
}
}
}
int main()
{
//ifstream infile;
// infile.open("1.txt");
int m, k,a,b;
scanf("%d%d%d", &n, &m, &k);
//infile >> n >> m >> k;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
//infile >> a >> b;
Adj[a].push_back(b);
Adj[b].push_back(a);
}
int u;
for (int i = 0; i < k; i++)
{
//inq[n] = { false };
fill(inq, inq + maxn, false);
cnt = 0;
scanf("%d", &u);
//infile >> u;
BFStrave(Adj,u);
printf("%d\n", cnt-2);
}
return 0;
}