Strongly connected component

A directed graph is called strongly connected if for every pair of vertices u and v there is a path from u to v and a path from v to u. The strongly connected components of a directed graph are its maximal strongly connected subgraphs.