Solution
= Solution
The <strongly connected components> are
$$
\boxed{\{1,3,5\},\quad\{2\},\quad\{4\},\quad\{6\}.}
$$
The <directed cycle> $1\to3\to5\to1$ makes its three vertices mutually reachable. Vertex $6$ has no outgoing edge. Vertex $2$ reaches that cycle but has no return path from it, and vertex $4$ reaches the other components but has no incoming path from them. These facts exclude every further merger.