Give an efficient algorithm which takes as input a directed graph G = (V, E), and determines whether or not there is a vertex s ϵ V from which all other vertices are reachable.
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.