拓扑排序序列
原理
Proposition. A digraph has a topological order if and only if it is a DAG.
Proposition. Reverse postorder in a DAG is a topological sort.
完整源码
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using namespace std;
int V, E;
//有向图
map<int, vector<int>> G;
bool marked[100]; // v 是否已经被访问过?
queue<int> postorder; // 后序序列
void dfs(int v) {
marked[v] = true;
for(vector<int>::it