Question - Describe a linear-time algorithm for computing the strong component containing a given vertex v.
On the basis of that algorithm, explain a simple quadratic-time algorithm for computing the strong components of a digraph.
Suppose that the digraph is represented in adjacency-list form.
I am not expecting a long answer, just something accurate for my understanding!