balanced_tree(r, h, create_using=None)
This is the rooted tree where all leaves are at distance h from the root. The root has degree r and all other internal nodes have degree :None:None:`r + 1`.
Node labels are integers, starting from zero.
A balanced tree is also known as a complete r-ary tree.
Branching factor of the tree; each node will have r children.
Height of the tree.
Graph type to create. If graph instance, then cleared before populated.
Returns the perfectly balanced r-ary tree of height h.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.readwrite.text.forest_str
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