  The star-comb lemma is a fundamental tool in infinite graph theory, which
states that for any infinite set $U$ of vertices in a connected graph $G$ there
exists either a subdivided infinite star in $G$ with all leaves in $U$, or an
infinite comb in $G$ with all teeth in $U$.
  In this paper, we elaborate a pendant of the star-comb lemma for directed
graphs. More precisely, we prove that for any infinite set $U$ of vertices in a
strongly connected directed graph $D$, there exists a strongly connected
substructure of $D$ attached to infinitely many vertices of $U$ that is either
shaped by a star or shaped by a comb, or is a chain of triangles.
