Arborescence (nonfiction)

From Gnomon Chronicles
Jump to navigation Jump to search

In graph theory, an arborescence is a directed graph in which, for a vertex u called the root and any other vertex v, there is exactly one directed path from u to v.

An arborescence is thus the directed-graph form of a rooted tree, understood here as an undirected graph.

In the News

Fiction cross-reference

Nonfiction cross-reference

External links: