Uva208——Firetruck

题目的意思：给你节点k，然后输入的是无向图，求1到节点k的所以路径。

首先用Floyd算法算出两两之间的是否存在路径。然后在递归求出路径的时候可以很快的判断是否有路到达k节点。

代码：

#include <iostream>
#include <cstring>
using namespace std;

const int maxn = 25;
const int INF = 0xfffffff;
int map[maxn][maxn], data[maxn][maxn], vis[maxn], ans[maxn];
int n, v, sum;

void init()
{
	for(int i = 0; i < maxn; i++)
		for(int j = 0; j < maxn; j++)
			map[i][j] = data[i][j] = INF;

	memset(vis, 0, sizeof(vis));
}

void dfs(int x, int y)
{
	if(x == n)         //到达结点n，输出路径
	{
		cout << 1 << ' ';
		for(int i = 1; i < y - 1; i++)
			cout << ans[i] << ' ';
		cout << ans[y - 1] << endl;
		sum++;
		return;
	}
	else
	{
		for(int i = 1; i <= v; i++)
		{
			if(map[x][i] == 1 && !vis[i] && data[n][i] != INF)  //查找路径
			{
				ans[y] = i;
				vis[i] = 1;
				dfs(i, y + 1);
				vis[i] = 0;
			}
		}
	}
}

int main()
{
//	freopen("1.txt", "r", stdin);
	int t = 0;
	while(cin >> n)
	{
		init();
		int a, b;
		v = sum = 0;
		while(cin >> a >> b && (a != 0 && b != 0))
		{
			data[a][b] = data[b][a] = 1;
			map[a][b] = map[b][a] = 1;
			if(a > v) v = a;
			if(b > v) v = b;
		}
		int i, j, k;
		for(k = 1; k <= v; k++)              //判断两两之间是否有路径
			for(i = 1; i <= v; i++)
				for(j = 1; j <= v; j++)
					if(data[i][j] > data[i][k] + data[k][j])
						data[i][j] = data[i][k] + data[k][j];

		vis[1] = 1;
		cout << "CASE " << ++t << ":" << endl;
		dfs(1, 1);
		cout << "There are " << sum << " routes from the firestation to streetcorner " << n << "." << endl;
	}
	return 0;
}