class Solution {
public:
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
vector<int> inorder(numCourses);
vector<int> edge[numCourses];
for (int i = 0; i < prerequisites.size(); ++i) {
assert(prerequisites[i].size() == 2);
edge[prerequisites[i][0]].push_back(prerequisites[i][1]);
inorder[prerequisites[i][1]]++;
}
queue<int> q;
for (int i = 0; i < numCourses; ++i) {
if (inorder[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
int v = q.front();
q.pop();
for (int i = 0; i < edge[v].size(); ++i) {
if (--inorder[edge[v][i]] == 0) {
q.push(edge[v][i]);
}
}
}
for (int i = 0; i < numCourses; ++i) {
if (inorder[i] != 0) {
return false;
}
}
return true;
}
};