Let $G=(V,E)$ be a directed graph with vertices $V$ and edges $E$. We denote with $n=|V|$ the number of vertices and with $m=|E|$ the number of edges in $G$.

A subset of vertices $C \subseteq V$ is called a **strongly connected component** if the following conditions hold: