UVa 208 Firetruck / dfs + floyd

给你一个无向图 和一个点 n 按字典序打印所有的从1到n路径 直接深搜 回溯 会TLE 剪个枝 先做一次floyd 如果途经 i点 判断从i 到 n是否可达 不可达就不用搜下去了

#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
int a[100][100];
int b[100][100];
int map[100];
int ans[100];
int cnt;
int n,m;
void dfs(int k,int u)
{
	int i;
	if(u == n)
	{
		cnt++;
		for(i = 0; i < k; i++)
		{
			if(i)
				printf(" ");
			printf("%d",ans[i]);
		}
		puts("");
		return ;
	}
	for(i = 1; i <= m; i++)
	{
		if(map[i])
			continue;
		if(!a[u][i])
			continue;
		if(!b[i][n])
			continue;
		map[i] = 1;
		ans[k] = i;
		//printf("%d\n",i);
		dfs(k+1,i);
		map[i] = 0;
	}
}
		
int main()
{
	int cas = 1;
	int i,j,k,x,y;
	while(scanf("%d",&n)!=EOF)
	{
		m = 0;
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		while(scanf("%d %d",&x,&y),x||y)
		{
			m = max(m,max(x,y));
			a[x][y] = a[y][x] = 1;
			b[x][y] = b[y][x] = 1;
		}
		for(k = 1;k <= m; k++)
			for(i = 1;i <= m; i++)
				for(j = 1;j <= m; j++)
					if(b[i][k] && b[k][j])
						b[i][j] = 1;
		cnt = 0;
		memset(map,0,sizeof(map));
		map[1] = 1;
		ans[0] = 1;
		printf("CASE %d:\n",cas++);
		dfs(1,1);
		printf("There are %d routes from the firestation to streetcorner %d.\n",cnt,n);
	}
	
	return 0;
}