Name for Turning DAG into redundant tree I am looking for a term:

How is the tree called that you can obtain from a DAG by going top-down and appending all visited nodes to a tree, thereby copying nodes from the DAG into multiple occurences in the tree?

The resulting tree will contain all edges and nodes from the original DAG and a number of nodes multiple times.

A -&gt; B
|    |
v    v
C -&gt; D


Will be turned into:

A -&gt; B -&gt; D
|
v
C
|
v
D


If you need clarifications, please ask.
I am not aware of any standard name for that kind of tree.  One of the wonderful things about language is that we can describe things we don't already have a name for; there are many more interesting concepts than there are pre-existing widely-recognized names.  I recommend that, if you find in your writing you need a concise name for it, you choose a name that seems suitable to you, and define it before first use.