Reachable vertex in a DAG.Design a linear-time algorithm to determine whether a DAG has a vertex that is reachable from every other vertex.
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.