networkx.generators.classic.full_rary_tree

full_rary_tree(r, n, create_using=None)[source]

Creates a full r-ary tree of n nodes.

Sometimes called a k-ary, n-ary, or m-ary tree. “… all non-leaf nodes have exactly r children and all levels are full except for some rightmost position of the bottom level (if a leaf at the bottom level is missing, then so are all of the leaves to its right.” [1]

Parameters
rint

branching factor of the tree

nint

Number of nodes in the tree

create_usingNetworkX graph constructor, optional (default=nx.Graph)

Graph type to create. If graph instance, then cleared before populated.

Returns
Gnetworkx Graph

An r-ary tree with n nodes

References

1

An introduction to data structures and algorithms, James Andrew Storer, Birkhauser Boston 2001, (page 225).