Give a linear time (0(VI + IE)) algorithm which takes as nput a directed graph G-(V E) and determines whether or not there is a vertex s E V from which all other vertices are reachable