Course Schedule (Cycle Detection)

There are n courses numbered 0..n-1. Each prerequisite pair 'a b' means you must take b before a. Print true if all courses can be finished, otherwise false.

1 <= n <= 2000 0 <= m <= 5000