Give a linear-time algorithm for the following task.
Input: A directed acyclic graph G
Question: Does G contain a directed path that touches every vertex exactly once?
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.