Task scheduling semesters

There are n tasks labeled 0..n-1 and a list of prerequisite pairs [a, b] meaning b must be finished before a. Each semester you may take any number of tasks whose prerequisites are all already finished. Return the minimum number of semesters needed to finish all tasks, or -1 if a cycle makes it impossible. With no prerequisites everything can be done in one semester.