poj1523图的割点 C语言描述

连通无向图是指对图中任意顶点u,v,都存在路径使u、v连通。<来自百度百科>

#include<stdio.h>
#include<string.h>
int n, m, e[1001][1001], root;
int num[1001], low[1001], flag[1001], index;
int min(int a, int b)
{
	return a < b ? a : b;
}
void dfs(int cur, int father)
{
	int i;
	int child = 0;
	index++;
	num[cur] = index;
	low[cur] = index;
	for (i = m; i <= n; i++)
	{
		if (e[cur][i] == 1)
		{
			if (num[i] == 0)
			{
				child++;
				dfs(i, cur);
				low[cur] = min(low[cur], low[i]);
				if (cur != root && num[cur] <= low[i])
					flag[cur]++;
				else if (cur == root && child >= 2)
					flag[cur]++;
			}
			else if (i != father)
			{
				low[cur] = min(low[cur], num[i]);
			}
		}
	}
	return;
}
int main()
{
	int i, j, k, x, y;
	j = 0;
	while (scanf("%d", &x),x)
	{
		scanf("%d", &y);
		index = 0;
		k = 0;
		n = 0;
		m = 1005;
		memset(flag, 0, sizeof(flag));
		memset(e, 0, sizeof(e));
		memset(num, 0, sizeof(num));
		memset(low, 0, sizeof(low));
		e[x][y] = e[y][x] = 1;
		if (x > n)n = x;
		if (y > n)n = y;
		if (x < m)m = x;
		if (y < m)m = y;
		while (scanf("%d", &x), x)
		{
			scanf("%d", &y);
			e[x][y] = e[y][x] = 1;
			if (x > n)n = x;
			if (y > n)n = y;
			if (x < m)m = x;
			if (y < m)m = y;
		}
		root = m;
		dfs(m, root);
		printf("Network #%d\n", ++j);
		for (i = m; i <= n; i++)
		{
			if (flag[i])
			{
				k = 1;
				printf("  SPF node %d leaves %d subnets\n", i,flag[i]+1);
			}
		}
		if (!k)printf("  No SPF nodes\n");
		printf("\n");
	}
	return 0;
}

参考代码 link