What is the name of this type of oriented acyclic graph?

Question

Perhaps this is not even a DAG, but as its naming im after I was not sure which title to give it ...

What is the name of the data structure where each node can have only 0 or 1 INTO paths? Strictly, is this a tree?

thanks

Answer 1

This is a directional tree. Ordinary trees as such are not oriented.

Your restriction is not exactly how the trees are defined (the definition of a tree is that any two vertices are connected in no more than one way), but this limits your graph to a regular directed tree. (If you do not want to use the strange ways of using the "directional tree" that require a uniform tropism, which I cannot say, I am interested.)

Answer 2

Are there other restrictions? From what you gave, I can build a graph that is not a tree.

A → B → A

If you add a restriction that the graph is acyclic, then it will be a tree.