拓扑排序 模板

/*注意初始化init();
 *点从0开始计算; 读入数据的时候要-1;输出的时候要加1
 *
 *
 */

int Ecnt = 0;
int n,m;
int const SIZE_E = //1000010;
int const SIZE_V = //10010;

struct edge_t{
    int v;
    edge_t  *next;
}Edge[SIZE_E];

edge_t *V[SIZE_V];
int InDeg[SIZE_V];

inline void mkEdge(int a,int b){
    Edge[Ecnt].v = b;
    Edge[Ecnt].next = V[a];
    V[a] = Edge + Ecnt++;
    InDeg[b]++;
}
//存储排序的结果
int ansSort[SIZE_V];
int AScnt = 0;

int topoSort(){
    int ret = 0;
    AScnt = 0;
    priority_queue < int , vector<int>,greater<int> > q;

    for (int i = 0; i < n;++i)
        if (InDeg[i] == 0)
            q.push(i);
    while(!q.empty()){


        int u = q.top();
        ansSort[AScnt++] = u;
        q.pop();

        ++ret;
        for (edge_t *p = V[u]; p ;p = p->next){
            int v = p->v;
            InDeg[v]--;
            if (0 == InDeg[v])
                q.push(v);
        }
    }
    return ret;
}
inline void init(){
    Ecnt = 0;
    AScnt = 0;
    memset(V,0,sizeof(V));
    memset(InDeg,0,sizeof(InDeg));
}

//打印拓扑排序结果
void PrintAnsV(){
    for (int i = 0;i < AScnt-1;++i)
        printf("%d ",ansSort[i]+1);
    printf("%d\n",ansSort[AScnt-1]+1);

}