TopologialSort拓扑排序

#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
vector<vector<int>> G;
vector<int> Indegree, Ans;
int Topological( int N )
{
    stack<int> s;
    int cnt = 0, v;
    for( int i = 0; i < N; ++i )
        if( !Indegree[i] )
            s.push(i);
    while( !s.empty() )
    {
        v = s.top();
        ++cnt;
        Ans.push_back( v );
        s.pop();
        for( int i = 0; i < G[v].size(); ++i )
            if( !(--Indegree[ G[v][i] ]) )
                s.push( G[v][i] );
    }
}
int main()
{
    int N, M, a, b;
    scanf("%d %d", &N, &M);
    Indegree.resize(N);
    G.resize(N);
    for( int i = 0; i < M; ++i )
    {
        scanf("%d %d", &a, &b);
        G[a].push_back(b);
        ++Indegree[b];
    }
    Topological( N );
    if( Ans.size() == N )
        for( int i = 0; i < Ans.size(); ++i )
            printf("%d%s", Ans[i], i == Ans.size() - 1 ? "":" ");
    else printf("No TopologicalSort Sequence!");
}

测试用例：
9 12
0 1
0 2
1 3
2 4
3 5
3 6
4 5
4 7
5 6
5 7
6 8
7 8