Transitive directed graph

Transitive directed graph --- транзитивный орграф.

A directed graph is transitive directed graph if, whenever the arcs [math]\displaystyle{ (x,y) }[/math] and [math]\displaystyle{ (y,z) }[/math] are in [math]\displaystyle{ G }[/math], the arc [math]\displaystyle{ (x,z) }[/math] is also in [math]\displaystyle{ G }[/math].