SPF

题目
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible. 

Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate. 

Input
The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.
Output
For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist. 

The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.
样例
Sample Input
1 2
5 4
3 1
3 2
3 4
3 5
0

1 2
2 3
3 4
4 5
5 1
0

1 2
2 3
3 4
4 6
6 3
2 5
5 1
0

0
Sample Output
Network #1
  SPF node 3 leaves 2 subnets

Network #2
  No SPF nodes

Network #3
  SPF node 2 leaves 2 subnets
  SPF node 3 leaves 2 subnets
  这是一道求割点的题目,只要求出割点就好了,想知道割点的求法可以参考一篇博客
  https://www.cnblogs.com/en-heng/p/4002658.html
  下面是ac代码
  

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define _for1(i,a,b) for( int i=(a); i<(b); ++i)
#define _for2(i,a,b) for( int i=(a); i>(b); i--)
#define _rep1(i,a,b) for( int i=(a); i<=(b); ++i)
#define _rep2(i,a,b) for( int i=(a); i>=(b); i--)
typedef long long ll;
using namespace std;
#define maxn 1010
vector G[maxn], ans;
int dfn[maxn], low[maxn], cut[maxn];
int tclock;

int tarjan(int u, int gen) {
	int lowu = dfn[u] == ++tclock;
	int child = 0;
	_for1(i, 0, G[i].size()) {
		int v = G[u][i];
		if (!dfn[v]) {
			child++;
			int lowv = tarjan(u, v);
			lowu = min(lowu, lowv);
			if (lowv >= dfn[u])
				cut[u]++;
		}
		else if (dfn[v] < dfn[u] && v != gen)
			lowu = min(lowu, dfn[v]);
	}
	if (gen < 0) {
		if (child >= 2)
			ans.push_back(u);
	}
	else if (cut[u] >= 1) {
		ans.push_back(u);
		cut[u]++;
	}
	return low[u] = lowu;
}

int main() {
	int u, v, kase = 1;
	while (scanf("%d", &u) == 1 && u) {
		tclock = 0;
		mem(dfn, 0), mem(low, 0), mem(cut, 0);
		ans.clear();
		_rep1(i, 1, 1000)
			G[i].clear();
		while (1) {
			scanf("%d", &v);
			G[u].push_back(v);
			G[v].push_back(u);
			scanf("%d", &u);
			if (u == 0)
				break; 
		}
		_rep1(i, 1, 1000)
			if (dfn[i] == 0 && G[i].size() > 0)
				tarjan(i, -1);
		sort(&ans[0], &ans[0] + ans.size());
		if (ans.size() > 0) {
			printf("Network #%d\n", kase++);
			_for1(i, 0, ans.size())
				printf("  SPF node %d leaves %d subnets\n", ans[i], cut[ans[i]]);
		}
		else
			printf("Network #%d\n  No SPF nodes\n", kase++);
		puts("");
	}
	return 0;
}

 

你可能感兴趣的:(强连通图)