POJ 1270Following Orders(拓扑+DFS）



Following Orders

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 4348		Accepted: 1751

Description

Order is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: ``a partially ordered set in which every chain has an upper bound contains a maximal element.'' Order is also important in reasoning about the fix-point semantics of programs.  


This problem involves neither Zorn's Lemma nor fix-point semantics, but does involve order.  
Given a list of variable constraints of the form x < y, you are to write a program that prints all orderings of the variables that are consistent with the constraints.  


For example, given the constraints x < y and x < z there are two orderings of the variables x, y, and z that are consistent with these constraints: x y z and x z y.  

Input

The input consists of a sequence of constraint specifications. A specification consists of two lines: a list of variables on one line followed by a list of contraints on the next line. A constraint is given by a pair of variables, where x y indicates that x < y.  


All variables are single character, lower-case letters. There will be at least two variables, and no more than 20 variables in a specification. There will be at least one constraint, and no more than 50 constraints in a specification. There will be at least one, and no more than 300 orderings consistent with the contraints in a specification.  


Input is terminated by end-of-file.  

Output

For each constraint specification, all orderings consistent with the constraints should be printed. Orderings are printed in lexicographical (alphabetical) order, one per line.  


Output for different constraint specifications is separated by a blank line.  

Sample Input

a b f g
a b b f
v w x y z
v y x v z v w v

Sample Output

abfg
abgf
agbf
gabf

wxzvy
wzxvy
xwzvy
xzwvy
zwxvy
zxwvy

题意： 第一行输入若干字母，第二行输入字母间的关系，输入所有可能的拓扑排序

思路：mark[]记录哪些字母存在，然后g[][]记录是否存在关系，in[]存每一个点的入度，然后搜索就可以了

     从in[]为0的点开始，然后将其与之相连的即g[i][] == 1的入度都减一，进入下一个点的搜索，回溯是要恢复现场把原来     入度减一的点在恢复++状态，同时i的入度变成0

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string.h>
#include <algorithm>
using namespace std;
int in[30];
int g[30][30],vis[30],mark[30];
int n,temp[30];
void dfs(int x, int cnt)
{
    if(cnt == n )
    {
        for(int i = 0; i < n; i++)
            printf("%c", temp[i] + 'a');
        printf("\n");
        return;
    }
    for(int i = 0; i < 26; i++)
    {
        if(mark[i] == 1 && in[i] == 0 && vis[i] == 0)
        {
            vis[i] = 1;
            temp[cnt] = i;
            in[i] = -1;

            for(int j = 0; j < 26; j++)
            {
                if(g[i][j] == 1 && in[j] > 0)
                {
                    in[j] --;
                }
            }
            dfs(i,cnt + 1);
            vis[i] = 0;
            for(int j = 0; j < 26; j++)
            {
                if(g[i][j] == 1)
                in[j] ++;
            }
            in[i] = 0;
        }
    }
}
int main()
{
    char s[500];
    int num = 0;
    while(gets(s))
    {
        n = 0;
        memset(in,0,sizeof(in));
        memset(g,0,sizeof(g));
        memset(vis,0,sizeof(vis));
        memset(mark,0,sizeof(mark));
        int len = strlen(s);
        for(int i = 0; i < len; i++)
        {
            if(s[i] != ' ')
            {
                mark[s[i] - 'a'] = 1;
                n++;
            }
        }
        gets(s);
        len = strlen(s);
        for(int i = 0; i < len; i += 4)
        {
            in[s[i + 2] - 'a'] ++;
            g[s[i] - 'a'][s[i + 2] - 'a'] = 1;
        }
        if(num != 0)
            printf("\n");
        num ++;
        dfs(0,0);
    }

    return 0;
}