207. Course Schedule（图解）

207. Course Schedule

There are a total of numCourses courses you have to take, labeled from 0 to numCourses-1.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]

Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?

Example 1:

Input: numCourses = 2, prerequisites = [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take. 
             To take course 1 you should have finished course 0. So it is possible.

Example 2:

Input: numCourses = 2, prerequisites = [[1,0],[0,1]]
Output: false
Explanation: There are a total of 2 courses to take. 
             To take course 1 you should have finished course 0, and to take course 0 you should
             also have finished course 1. So it is impossible.

Solution

C++
Sol1:

class Solution {
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        vector<vector<int>> v(numCourses);
        vector<int> degree(numCourses);
        for(auto& pre: prerequisites) {
            v[pre[1]].push_back(pre[0]);
            ++degree[pre[0]];
        }
        
        queue<int> q;
        for(int i = 0; i < numCourses; ++i)
            if(degree[i]==0) q.push(i);
        
        while(!q.empty()) {
            int x = q.front();
            q.pop();
            --numCourses;
            for(auto& p: v[x]) {
                if(--degree[p] == 0) q.push(p);
            }
        }
        
        return numCourses == 0;
    }
};

Sol2:

class Solution {
public:
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
        vector<vector<int>> v(numCourses);
        vector<int> c(numCourses);
        for(auto& pre: prerequisites) {
            v[pre[1]].push_back(pre[0]);
        }
        
        for(int i = 0; i < numCourses; ++i) {
            if(!dfs(i,c,v))
                return false;
        }
        return true;
    }
    
    bool dfs(int n, vector<int>& c, vector<vector<int>>& v) {
        if(c[n] == 1) return true;
        if(c[n] == -1) return false;
        c[n] = -1; // visiting
        for(int p: v[n]) {
            if(!dfs(p,c,v)) return false;
        }
        c[n] = 1; // visited
        return true;
    }
};

Explanation
Sol1: BFS

Sol2: DFS