poj 1094 拓扑排序

                                                                      Sorting It All Out

 

Description

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A < B, B < C and C < D. in this problem, we will give you a set of relations of the form A < B and ask you to determine whether a sorted order has been specified or not.

Input

Input consists of multiple problem instances. Each instance starts with a line containing two positive integers n and m. the first value indicated the number of objects to sort, where 2 <= n <= 26. The objects to be sorted will be the first n characters of the uppercase alphabet. The second value m indicates the number of relations of the form A < B which will be given in this problem instance. Next will be m lines, each containing one such relation consisting of three characters: an uppercase letter, the character "<" and a second uppercase letter. No letter will be outside the range of the first n letters of the alphabet. Values of n = m = 0 indicate end of input.

Output

For each problem instance, output consists of one line. This line should be one of the following three:

Sorted sequence determined after xxx relations: yyy...y.
Sorted sequence cannot be determined.
Inconsistency found after xxx relations.

where xxx is the number of relations processed at the time either a sorted sequence is determined or an inconsistency is found, whichever comes first, and yyy...y is the sorted, ascending sequence.

Sample Input

4 6
A<B
A<C
B<C
C<D
B<D
A<B
3 2
A<B
B<A
26 1
A<Z
0 0

Sample Output

Sorted sequence determined after 4 relations: ABCD.
Inconsistency found after 2 relations.
Sorted sequence cannot be determined.



拓扑排序：
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define max 30
int indegree[max],map[max][max],q[max];

int topsort(int n)
{
    int i,j,c=0,flag=1,m,loc,temp[max];
    for(i=1;i<=n;i++)
    temp[i]=indegree[i];
    for(i=1;i<=n;i++)
    {
        m=0;
        for(j=1;j<=n;j++)
        if(temp[j]==0)
        {
            m++;
            loc=j;
        }
        if(m==0)
        return 0;//  有环
        if(m>1)      //如果有好几个入度为0的点，那么做个标记继续进行判断，防止出现环的情况 
        flag=-1;     //例如：A<C,C<D,B<D,D<C   这种情况会出现环 
        
        q[c++]=loc;  //入度为0的点入队
        temp[loc]=-1;
        for(j=1;j<=n;j++)
        {
            if(map[loc][j])
            temp[j]--;      //减掉那个跟loc有关的一个入度，等于删掉一条边 
        }
    }
    return flag;
}
int main()
{
    int i,j;
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
         if(n==0 && m==0)
         return 0;
         
         char str[5];
         int sign=0;
         memset(map,0,sizeof(map));
         memset(indegree,0,sizeof(indegree));
         for(i=1;i<=m;i++)
         {
             scanf("%s",&str);
             if(sign)
             continue;
             int x=str[0]-'A'+1;
             int y=str[2]-'A'+1;
             map[x][y]=1;
             indegree[y]++;   //入度加加
             int s=topsort(n);
             if(s==0)
             {
                 printf("Inconsistency found after %d relations.\n",i);  //有环 
                 sign=1;
             }
             if(s==1)
             {
                 printf("Sorted sequence determined after %d relations: ",i); //有序 
                 for(j=0;j<n;j++)
                 printf("%c",q[j]+'A'-1);
                 printf(".\n");
                 sign=1;
             }
         }
         if(!sign)   //如果没有结果，那么sign就是0
         printf("Sorted sequence cannot be determined.\n");  //不能判断 
    }
    return 0;
}
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define max 30
int indegree[max],map[max][max],q[max];

int topsort(int n)
{
    int i,j,c=0,flag=1,m,loc,temp[max];
    for(i=1;i<=n;i++)
    temp[i]=indegree[i];
    for(i=1;i<=n;i++)
    {
        m=0;
        for(j=1;j<=n;j++)
        if(temp[j]==0)
        {
            m++;
            loc=j;
        }
        if(m==0)
        return 0;//  有环
        if(m>1)      //如果有好几个入度为0的点，那么做个标记继续进行判断，防止出现环的情况 
        flag=-1;     //例如：A<C,C<D,B<D,D<C   这种情况会出现环 
        
        q[c++]=loc;  //入度为0的点入队
        temp[loc]=-1;
        for(j=1;j<=n;j++)
        {
            if(map[loc][j])
            temp[j]--;      //减掉那个跟loc有关的一个入度，等于删掉一条边 
        }
    }
    return flag;
}
int main()
{
    int i,j;
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
         if(n==0 && m==0)
         return 0;
         
         char str[5];
         int sign=0;
         memset(map,0,sizeof(map));
         memset(indegree,0,sizeof(indegree));
         for(i=1;i<=m;i++)
         {
             scanf("%s",&str);
             if(sign)
             continue;
             int x=str[0]-'A'+1;
             int y=str[2]-'A'+1;
             map[x][y]=1;
             indegree[y]++;   //入度加加
             int s=topsort(n);
             if(s==0)
             {
                 printf("Inconsistency found after %d relations.\n",i);  //有环 
                 sign=1;
             }
             if(s==1)
             {
                 printf("Sorted sequence determined after %d relations: ",i); //有序 
                 for(j=0;j<n;j++)
                 printf("%c",q[j]+'A'-1);
                 printf(".\n");
                 sign=1;
             }
         }
         if(!sign)   //如果没有结果，那么sign就是0
         printf("Sorted sequence cannot be determined.\n");  //不能判断 
    }
    return 0;
}