full_rary_tree(r, n, create_using=None)
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."
branching factor of the tree
Number of nodes in the tree
Graph type to create. If graph instance, then cleared before populated.
An r-ary tree with n nodes
Creates a full r-ary tree of n nodes.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them