A tree is defined as a connected acyclic undirected graph at page 171 of this online book.
What is the equivalent of a tree for directed graphs? A connected acyclic directed graph (i.e. a connected DAG)? In other words, what is a directed tree? If you have a good reference I am really interested.
Best Answer
With the help of Narsingh Deo’s book Graph Theory with Applications to Engineering and Computer Science (thank you @ShubhamJohri for the reference) I could answer to myself:
Section 9.4. Directed paths and connectedness:
Section 9.6. Trees with directed edges:
Section 9.11. Acyclic digraphs and decyclization:
To sum up, for directed graphs:
For instance, this connected DAG is not a directed tree: ({a, b, c}, {(a, b), (b, c), (a, c)}), since even if it is connected (more precisely weakly connected) it has semicycles, for instance (a, (a, b), b, (b, c), c, (a, c), a).
Likewise, for directed graphs:
Another convention calls a directed tree a polytree, an arborescence a directed tree, a directed forest a polyforest and a branching a directed forest.
Cf. the documentation of NetworkX, a Python library.