Problem 5 - Graph Algorithms

1.

Describe the definition of the strongly connected components of a directed graph $G=(V,E)$, where $V$ is a set of vertices and $E$ is a set of edges.

2.

Show an algorithm to compute the strongly connected components of $G$. Analyze its computational complexity.

See [SED00] for a detailed answer.