Tarjan algorithm is another important algorithm for finding strongly connected components(SCCs) in directed graph. Comparing to Kosaraju algorithm, Tarjan doesn't need to generate transpose Graph.
See in https://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm.