We study the strongly connected components of the flow graph associated to a veering triangulation, and show that the infinitesimal components must be of a certain form, which have to do with subsets of the triangulation which we call "walls". We show two applications of this knowledge: first, we fix a proof in the original paper by the first author which introduced veering triangulations; and second, give an alternate proof that veering triangulations induce pseudo-Anosov flows without perfect fits, which was initially proved by Schleimer and Segerman. 57M50; 37D20, 37E30 Ã tetrahedra.Note that the bound we obtain is worse than that stated in [Agol 2011] by an exponent of 2 C ", but there might be room for improvement.To reprove Schleimer and Segerman's construction, we apply the general strategy outlined above to the reduced flow graph: we thicken up the graph by flow boxes, and collapse along its complement, with