Either prove or give a counterexample: if {u, v} is an edge in an undirected graph, and during depth-first search post (u) < post (v), then v is an ancestor of u in the DFS tree.
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.