Arborescence (graph theory)
Directed graph where every node has exactly one path to it from the root / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Arborescence (graph theory)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In graph theory, an arborescence is a directed graph having a distinguished vertex u (called the root) such that, for any other vertex v, there is exactly one directed path from u to v.[1] An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph.[2][3] An arborescence is also a directed rooted tree in which all edges point away from the root; a number of other equivalent characterizations exist.[4][5]
Every arborescence is a directed acyclic graph (DAG), but not every DAG is an arborescence.