2 more posts in this thread. [Missing image file: algo.png]
Suppose a CS curriculum consists of n courses, all of them mandatory. The graph G = (V, E) of prerequisites has a vertex for each course, and an edge from course u to course w if and only if u is a prerequisite for w. Give an algorithm that works directly with this graph representation, and computes the minimum number of quarters necessary to complete the curriculum. Assume that a student can take any number of courses in one quarter. The running time of your algorithm should be O(V + E).
Describe in pseudocode