What do you call a DAG with a single root/source?

What's the name for a DAG (directed acyclic graph) that has a unique root or source node from which every other node can be reached?

Alternatively, if you change the direction of the arrows, what's the name for a DAG that has some unique sink node that is reachable from every other node?

Here's an example graph:

In a directed graph we do not speak of roots and leaves, but of sources and sinks.

I'm not aware of any term that designates a DAG with only a single source, but you could just call it that: "a DAG with a single source".

StackExchange Computer Science Q#67849, answer score: 9