A tree graph is essentially a kind of dendrogram, which means clustering results can be generated solely by making a cross cut at some height between the root and the leaves.
as there is no horizontal connection at the same level, it is not possible to create triangle circulation paths in a single stroke.