human
I found an interesting problem on https://leetcode.com/problems/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?

Example 1:

Input: 2, [[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: 2, [[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.

Note:

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

I tried it in Python, but could not do it. Can you solve it?

=====
Write me a the Python program you requested?
assistant
#Here is the Python program you requested.

class Solution:
     def canFinish(self, numCourses, prerequisites):
         """
         :type numCourses: int
         :type prerequisites: List[List[int]]
         :rtype: bool
         """
         from collections import deque
         class Vertex(object):
             def __init__(self):
                 self.inDegree = 0
                 self.visited = False
                 self.adjList = []
                 self.invAdjList = []
             def info(self):
                 print(self.adjList)
                 print(self.invAdjList, self.inDegree)
                 print(self.visited)
         #initialization
         vertices = []
         for _ in range(numCourses):
             vertices.append(Vertex())
 
         for i in prerequisites:
             pre = i[0]
             post = i[1]
             vertices[pre].adjList.append(post)
             vertices[post].inDegree += 1
             vertices[post].invAdjList.append(pre)
 
         #BFS
         q = deque()
         coursesLearned = []
         for i in range(numCourses):
             if vertices[i].inDegree == 0:
                 q.append(i)
 
         while q:
             course = q.popleft()
             coursesLearned.append(course)
             vertices[course].visited = True
             for c2 in vertices[course].adjList:
                 vertices[c2].inDegree -= 1
                 if vertices[c2].inDegree == 0:
                     q.append(c2)
         return len(coursesLearned) == numCourses