e/Arborescence (graph theory)

Information
has gloss	eng: In graph theory, an arborescence is a directed graph in which, for a vertex v called the root and any other vertex u, there is exactly one directed path from v to u. In other words, an arborescence is a directed, rooted tree in which all edges point away from the root. Every arborescence is a directed acyclic graph.
lexicalization	eng: arborescence
instance of	c/Trees (graph theory)