Prove that in a depth-first spanning forest of a directed graph, all cross edges go from right to left.
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.