strongly connected components in directed graph. Kosaraju's algorithm.
It's a well-known problem and the well-known solution is using a stack. I tried to solve it by segment tree( iterative version for building tree ) and got TLE. Hope I can optimize the code. TLE CODE
Comments
Post a Comment