【POJ 2186】拓扑排序

/*
g[i][j]为邻接矩阵，e[i]为i的入度
in==1代表有矛盾，d==1代表确定顺序
so存排好的顺序
*/
#include<cstdio>
#include<cstring>
#define N 30
int n, m, g[N][N], e[N], c[N], a, b, in, d, so[N];
char va, vb;
void topo()
{
    memcpy(c, e, sizeof e);//复制e到c，因为后面要对c改动，所以不能直接用e
    int i, top = -1;
    for(i = 0; i < n; i++)
        if(!c[i])
        {
            c[i] = top;//模拟下标堆栈，把入度为0的点通过下标堆栈到c中
            top = i;
        }
    for(i = 0; i < n; i++)
    {
        if(top == -1)//n次循环中，若某次找不到入度为0的点，就会回到-1
        {
            in = 1;//说明存在环
            return;
        }
        int u = top;//以top为起点
        top = c[u];
        so[i] = u;
        for(int v = 0; v < n; v++)
            if(g[u][v] && (--c[v]) == 0)//去掉u出发的边后，入度为0的点
            {
                c[v] = top; //堆栈
                top = v;
            }
    }
    d = 1;
    for(i = 1; i < n; i++)//判断是否是确定的顺序
        if(!g[so[i - 1]][so[i]])d = 0;//如果出现相邻两个没有给过偏序关系，那么就是不确定的顺序
 
}
int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d%d ", &n, &m) && n)
    {
        memset(g, 0, sizeof g);
        memset(e, 0, sizeof e);
        d = in = 0;
        for(int i = 1; i <= m; i++)
        {
            scanf("%c<%c ", &va, &vb);
            a = va - ‘A‘;
            b = vb - ‘A‘;
            if(!g[a][b] && !d && !in)
            {
                g[a][b] = 1;
                e[b]++;
                topo();
                if(in)
                    printf("Inconsistency found after %d relations.\n", i);
                else if(d)
                {
                    printf("Sorted sequence determined after %d relations: ", i);
                    for(int j = 0; j < n; j++)printf("%c", so[j] + ‘A‘);
                    printf(".\n");
                }
            }
        }
        if(!d && !in)printf("Sorted sequence cannot be determined.\n");
    }
}