207. Course Schedule

题目：

There are a total of n courses you have to take, labeled from 0 to n - 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?

For example:

2, [[1,0]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.

2, [[1,0],[0,1]]

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.

Note:

1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

分析：

该题明显的是一道BTS的拓扑排序，其实质就是判断该有向图是否有环。

      ( 1) 选择一个入度为0的顶点并输出之；

(2) 从图中删除此顶点及所有出边。循环结束后，若输出的顶点数小于网中的顶点数，则输出"有回路"信息，否则输出的顶点序列就是一种拓扑序列。

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<int> rudegree(numCourses,0);
        vector<vector<int>> gra(numCourses, vector<int>(0));
        
        queue<int> que;
        int cur;
        
        for(auto p: prerequisites){
            gra[p.first].push_back(p.second);
            rudegree[p.second]++;
        }
        
        for(int i = 0; i < numCourses; i++){ 
            if(rudegree[i]==0) que.push(i);
        }
        
        while(!que.empty()){ 
            cur = que.front();
            que.pop();
            for(auto p: gra[cur]){
                rudegree[p]--;
                if(rudegree[p]==0) que.push(p);
            }
        }
        
        for(int i = 0; i < numCourses; i++)
            if(rudegree[i]!=0)  return false;
        return true;
    }
};