Arborescence

A Digraph is called an arborescence if, from a given node $x$ known as the Root, there is exactly one elementary path from $x$ to every other node $y$.

See also Arboricity