Read on Wikipedia

Image: BagLuke · CC0

Arborescence (graph theory)

Arborescence (graph theory)

Directed graph where every node has exactly one path to it from the root.

Rare
26 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

RareTop 25%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 726

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 315 clicks on its links

  1. Tree (graph theory)

    Undirected, connected, and acyclic graph.

    33%

  2. Directed acyclic graph

    Directed graph with no directed cycles.

    22%

  3. Multitree

    Type of graph in mathematics.

    10%

  4. Rooted graph

    6.3%

Readers come from

Share of the 742 readers arriving from another article

  1. Binary tree

    Limited form of tree data structure.

    23%

  2. Tree (graph theory)

    Undirected, connected, and acyclic graph.

    21%

  3. M-ary tree

    Tree data structure in which each node has at most m children.

    8.8%

  4. Directed acyclic graph

    Directed graph with no directed cycles.

    8%

  5. Polytree

    Type of graph in mathematics.

    5.4%

  6. Minimum spanning tree

    Least-weight tree connecting graph vertices.

    4.2%