Arborescence (graph theory)

From Wikipedia, the free encyclopedia

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.