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
If you need clarifications, please ask.