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: