As given in cp-algorithms.com for SCC, that we need to reverse the graph after sorting the vertices in decreasing order of exit time for finding strongly connected component so that we do not jump out into another SCC.
But instead of reversing the graph and traversing it can't we just traverse the original graph with increasing order of exit time ??
Please Help!! Thanks in advanced :)