True or false: If we modify the Kosaraju-Sharir algorithm to run the first depth-first search in the digraph G(instead of the reverse digraph GR)and the second depth-first search in GR(instead of G), then it will still find the strong components.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.