207. Course Schedule 难度：medium 类别：图

题目：

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.

思路：

此题要我们判断给定的图能否进行拓扑排序，就用拓扑排序的一般方法对图进行排序，看最终序列的元素个数是否等于节点数，如果相等则可以进行拓扑排序，否则则不能。

程序：

def canFinish(self, numCourses, prerequisites):
        """
        :type numCourses: int
        :type prerequisites: List[List[int]]
        :rtype: bool
        """
        queue = []
        result = []

        adj = [[] for i in range(numCourses)]
        indegree = [0 for i in range(numCourses)]

        for l in prerequisites:
            adj[l[1]].append(l[0])
            indegree[l[0]] += 1

    
        for i in range(numCourses):
            if indegree[i] == 0:
                queue.append(i)

        while len(queue) != 0:
            u = queue.pop(0)
            result.append(u)
        
            for v in adj[u]:
                indegree[v] -= 1
                if indegree[v] == 0:
                    queue.append(v)

        if len(result) == numCourses:
            return True

        else:
            return False