If we reformulate the definition of spanning trees in connected symmetric paths as:

connected graphs that contain for every unordered pair of vertices a unique connecting paths

then that definition carries directly over to digraphs, albeit with a minor adaption:

connected graphs that contain for every ordered pair of vertices a unique connecting paths

Question:
is there an established name for digraphs that satisfy the above condition of having a unique connecting path for every ordered pair of vertices?