LeetCode 207.课程表（拓扑排序）

solution

bfs实现。注意题目中的边缘列表要转换成邻接表。

code

class Solution {
private:
    vector<vector<int>> edge;
    vector<int> indeg;
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        edge.resize(numCourses);
        indeg.resize(numCourses);
        for (const auto& v : prerequisites) {
            edge[v[1]].push_back(v[0]);
            ++indeg[v[0]];
        }
        queue<int> q;
        for (int i = 0; i < numCourses; ++i) {
            if (indeg[i] == 0) {
                q.push(i);
            }
        }
        int topo = 0;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            ++topo;
            for (auto v : edge[u]) {
                --indeg[v];
                if (indeg[v] == 0) {
                    q.push(v);
                }
            }
        }
        return topo == numCourses;
    }
};