LeetCode 筆記 - 207. Course Schedule

class Solution:
    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
        
        node = [[] for _ in range(numCourses)]
        for p in prerequisites:
            node[p[0]].append(p[1])
        
        visited = set()
        
        def dfs(index, cycle):
            if index in cycle:
                # cycle detected
                return False
            if index in visited:
                # visited before, so doesn't need dfs any more
                return True
            
            # put this course in dfs path
            current_cycle = cycle + [index]
            
            for i in node[index]:
                if not dfs(i, current_cycle):
                    return False
            # dfs is done and all course is ok!
            visited.add(index)
            
            return True
        
        for i in range(numCourses):
            if not dfs(i, []):
                return False
        return True