Programming Challenges 习题10.5.6

PC/UVa：111006/10199

Tourist Guide

这道题比较简单，题目中所描述的摄像头的位置，即为图的割顶（articulation vertex）。我之前只听过割边（cut edge），但是道理是一样的。首先将找出原图中所有的连通分量，然后针对每个连通分量，依次去除该连通分量中的每个顶点，如果图不连通则为所求。

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>

using namespace std;

void divideGraph(vector<set<size_t>> &vecChildGraph, const vector<vector<size_t>> &Graph)
{
	vector<bool> vbVisit(Graph.size(), false);
	while (1){
		size_t curr = vbVisit.size();
		for (size_t idx = 0; idx < vbVisit.size(); idx++)
		{
			if (!vbVisit[idx]){
				curr = idx;
				break;
			}
		}
		if (curr == vbVisit.size()) break;
		vecChildGraph.push_back(set<size_t>());
		set<size_t> &child = vecChildGraph.back();
		child.insert(curr);
		queue<size_t> qCity;
		qCity.push(curr);
		vbVisit[curr] = true;
		while (!qCity.empty()){
			curr = qCity.front();
			qCity.pop();
			const vector<size_t> &vecAdjacent = Graph[curr];
			for (auto adj : vecAdjacent)
			{
				if (!vbVisit[adj]){
					child.insert(adj);
					qCity.push(adj);
					vbVisit[adj] = true;
				}
			}
		}
	}
	return;
}

void calArticulation(const set<size_t> &childGraph, const vector<vector<size_t>> &Graph,
	set<size_t> &sCamera)
{
	//依次去掉图中的每个顶点，如果不连通，则为所求
	for (auto camera : childGraph)
	{
		size_t curr = camera;
		vector<bool> vbVisit(Graph.size(), false);
		//查找第一个不是摄像头的点
		for (auto vertex : childGraph)
		{
			if (vertex != camera){
				curr = vertex;
				break;
			}
		}
		if (curr == camera) break;
		queue<size_t> qCity;
		qCity.push(curr);
		vbVisit[curr] = true;
		while (!qCity.empty()){
			curr = qCity.front();
			qCity.pop();
			const vector<size_t> &vecAdjacent = Graph[curr];
			for (auto adj : vecAdjacent)
			{
				if (adj != camera && !vbVisit[adj]){
					qCity.push(adj);
					vbVisit[adj] = true;
				}
			}
		}
		for (auto vertex : childGraph)
		{
			if (vertex != camera && !vbVisit[vertex]){
				sCamera.insert(camera);
				break;
			}
		}
	}
}

int main()
{
	int CityMap = 1;
	int N = 0, R;
	while (cin >> N){
		if (N == 0) break;
		string strCity, strCity2;
		vector<string> vsID2City;
		map<string, size_t> mCity2ID;
		for (int n = 0; n < N; n++)
		{
			cin >> strCity;
			mCity2ID[strCity] = vsID2City.size();
			vsID2City.push_back(strCity);
		}
		vector<vector<size_t>> Graph(N, vector<size_t>());
		cin >> R;
		size_t ID, ID2;
		for (int r = 0; r < R; r++)
		{
			cin >> strCity >> strCity2;
			ID = mCity2ID[strCity];
			ID2 = mCity2ID[strCity2];
			Graph[ID].push_back(ID2);
			Graph[ID2].push_back(ID);
		}
		vector<set<size_t>> vecChildGraph;
		divideGraph(vecChildGraph, Graph);
		set<size_t> sCamera;
		for (size_t child = 0; child < vecChildGraph.size(); child++)
		{
			const set<size_t> &childGraph = vecChildGraph[child];
			calArticulation(childGraph, Graph, sCamera);
		}
		if (CityMap != 1) cout << endl;
		cout << "City map #" << CityMap++ << ": " << sCamera.size() << " camera(s) found" << endl;
		for (auto iter = mCity2ID.begin(); iter != mCity2ID.end(); iter++)
		{
			if (sCamera.find(iter->second)!= sCamera.end()){
				cout << iter->first << endl;
			}
		}
	}
	return 0;
}
/*
6
sugarloaf
maracana
copacabana
ipanema
corcovado
lapa
7
ipanema copacabana
copacabana sugarloaf
ipanema sugarloaf
maracana lapa
sugarloaf maracana
corcovado sugarloaf
lapa corcovado
5
guanabarabay
downtown
botanicgarden
colombo
sambodromo
4
guanabarabay sambodromo
downtown sambodromo
sambodromo botanicgarden
colombo sambodromo
0
*/