# 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 -> B
|    |
v    v
C -> D


Will be turned into:

A -> B -> D
|
v
C
|
v
D


• @rex123 I'm thinking OP might be talking about the tree $T$ of all reachable paths starting from a selected vertex $A$ in an input DAG. Each node correspond to a path that starts from $A$ and each edge in $T$ correspond to the relationship that a path extends to become another one. – Apiwat Chantawibul Nov 5 '19 at 12:39