程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> UVA Firetruck (DFS)

UVA Firetruck (DFS)

編輯：C++入門知識

UVA Firetruck (DFS)

The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets are closed for repairs or construction. Firefighters need to be able to select routes from the firestations to fires that do not use closed streets.

Central City is divided into non-overlapping fire districts, each containing a single firestation. When a fire is reported, a central dispatcher alerts the firestation of the district where the fire is located and gives a list of possible routes from the firestation to the fire. You must write a program that the central dispatcher can use to generate routes from the district firestations to the fires.

Input

The city has a separate map for each fire district. Streetcorners of each map are identified by positive integers less than 21, with the firestation always on corner #1. The input file contains several test cases representing different fires in different districts.

Output

For each test case, your output must identify the case by number (CASE #1, CASE #2, etc). It must list each route on a separate line, with the streetcorners written in the order in which they appear on the route. And it must give the total number routes from firestation to the fire. Include only routes which do not pass through any streetcorner more than once. (For obvious reasons, the fire department doesn't want its trucks driving around in circles.)

Output from separate cases must appear on separate lines.

The following sample input and corresponding correct output represents two test cases.

Sample Input

Sample Output

CASE 1:
1 2 3 4 6
1 2 3 5 6
1 2 4 3 5 6
1 2 4 6
1 3 2 4 6
1 3 4 6
1 3 5 6
There are 7 routes from the firestation to streetcorner 6.
CASE 2:
1 3 2 5 7 8 9 6 4
1 3 4
1 5 2 3 4
1 5 7 8 9 6 4
1 6 4
1 6 9 8 7 5 2 3 4
1 8 7 5 2 3 4
1 8 9 6 4
There are 8 routes from the firestation to streetcorner 4.

題意：按字典序輸出1~k的所有路徑

#include
#include
#include
#include
#include
#include
typedef long long LL;
using namespace std;
int mp[25][25];
int visit[25];
int num[25];
int vis[25];
int a[25],sum;
int k,cnt;
void DFS(int cur)
{
    vis[cur]=1;
    a[sum++]=cur;
    for(int i=1;i<=25;i++)
    {
        if(!vis[i]&&mp[cur][i])
            DFS(i);
    }
}
void dfs(int cur,int s)
{
    if(cur==k)
    {
        cnt++;
        for(int i=0;i