Term for a "rooted" directional graph?
I don't know if these graphs have a common name. But I think, one would call vertices with no outgoing edge rather a sink than a root.

This paper studies acyclic orientations of grid graphs. They call an orientation, which would correspond to the graphs you consider, acyclic orientations with a unique sink.