graph theory question

[ntrhieu]

what is the best algorithms to find all strongly connected component of a graph ? I only know the trivial one in text book with time O(V * (E+v)) or O(V^3).

Thanks

[arnsfelt]

That would be Tarjan's algorithm. It consists of just two depth-first searches, giving a running time of O(n+m)

[ntrhieu]

thanks, it said O(n) to determine strongly connected components. Looks great