On tree graphs of directed graphs

A method is presented for the construction of a directed graph whose directed tree graph is an open-edge train of
n
edges.