[数据结构与算法]拓扑排序——C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#include <climits>
using namespace std;
const int MAXN = 100;

vector<int> graph[MAXN];
int inDegree[MAXN];//记录每个顶点的入度

vector<int> TopologicalSort(int n){
    vector<int> topology; //存储最终拓扑序列
    priority_queue<int ,vector<int>,greater<int>> node;
    for (int i = 0; i < n; ++i) {
        if (inDegree[i] == 0){//初始入度为0
            node.push(i);//入队
        }
    }
    while (!node.empty()){
        int u = node.top();//取出队头
        node.pop();
        topology.push_back(u);
        //更新以u为入度的顶点v的入度数,若更新后为0，进入入度为0的队列
        for (int i = 0; i < graph[u].size(); ++i) {
            int v = graph[u][i];
            inDegree[v]--;
            if (inDegree[v]==0){
                node.push(v);
            }
        }
    }
    return topology;
}