위상정렬

#include #include #include using namespace std;int main(){ for (int T = 1; T > V >> E; vector> graph(V + 1); vector indegree(V + 1, 0); for (int i = 1; i > u >> v; graph[u].push_back(v); indegree[v]++; } queue q; cout