Note that component graph is given a topological numbering!
We left out the computation of the edges D of the component graph (HW).
Note what happens when we ``topologically sort'' a cyclic graph.
