LeetCode: 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.

题目给出课程数和课程之间的关系，[i，j]表示上i课程之前要先完成j课程。根据给出的课程间的关系，判断课程是否可安排。

其实，题目可以抽象为一个图，每门课程表示图中的一个节点，[i，j]表示一条j到i的有向边，只要图中无环，就说明课程是可安排的。
那么，怎么更好地判断图中是否有环呢？可以使用拓扑排序算法，一个有向图能拓扑排序的充要条件是图中无环，如果图不能拓扑排序，则说明图中有环，课程不可安排。
算法流程：将图中所有入度为0的节点入队，当队列非空时，弹出队头，删去以队头为出发点的边，一旦发现有节点的入度为0，就将节点入队，直到队列为空时跳出循环。最后判断是否所有点的入度都为0，如果是，则说明该图可拓扑排序，图中无环。否则说明图中有环。
为更好的实现算法，用邻接表来保存图，并用一个数组来保存每个节点的入度。Accepted的代码：

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        //保存每个节点的入度数
        vector<int> inDegree;
        //用邻接表保存图
        vector<vector<int> > graph;
        //初始化
        for(int i=0;i<numCourses;i++)
        {
            inDegree.push_back(0);
            vector<int> temp;
            graph.push_back(temp);
        }
        //填充图
        for(int i=0;i<prerequisites.size();i++)
        {
            graph[prerequisites[i].second].push_back(prerequisites[i].first);
            inDegree[prerequisites[i].first]++;
        }
        //拓扑排序
        queue<int> q;
        //将所有入度为0的点入队
        for(int i=0;i<numCourses;i++)
            if(inDegree[i]==0) q.push(i);
        //删除边，并将入度为0的点入队
        while(q.empty()==false)
        {
            int t=q.front();
            q.pop();
            for(int i=0;i<graph[t].size();i++)
            {
                inDegree[graph[t][i]]--;
                if(inDegree[graph[t][i]]==0) q.push(graph[t][i]);
            }
        }
        //图中还存在入度不为0的点，则有环
        for(int i=0;i<numCourses;i++)
            if(inDegree[i]!=0) return false;

        return true;
    }
};