$20\mathrm{.}5-3$

Professor Bacon rewrites the algorithm for strongly connected components to use

the original $($instead of the transpose$)$ graph in the second depth$-$rst search and

scan the vertices in order of increasing $$nish times. Does this modi$$ed algorithm

always produce correct results?