Strongly Connected Component

A maximal subgraph of a Directed Graph such that for every pair of vertices $u$, $v$ in the Subgraph, there is a directed path from $u$ to $v$ and a directed path from $v$ to $u$.

See also Bi-Connected Component