Strongly connected components (directed graphs)

maths
Strongly connected components

Let $G = (V,E)$ be a directed graph. We say $C \subset V$ is a strongly connected component if all vertices $x,y \in C$ are strongly connected and $C$ is maximal with this property.