Hello codeforces!
Recently i was searching for a good explanation of Tarjan Strongly connected components algorithm but i failed to understand the concept and the algorithm. can anyone help me by providing a good explanation of this algorithm or providing a useful link?
One more question: Does tarjan algorithm works on undirected graph for finding biconnected components?
Thanks!
read it from competitive programming 3 book ,they explained it clearly :)
Does Tarjan algorithm also works on undirected graph for finding biconnected components ?
Yes, but slightly different.
The original paper from 1972 covered it all.
also this video explain this algorithm but not tarjan's algorithm,it's Kosaraju's Algorithm