hyperiax.symmetric_topology

hyperiax.symmetric_topology(depth, degree)

A regular tree where every internal node has exactly degree children.

A tree of depth=0 contains just the root; depth=1 has the root plus one level of degree leaves; and so on. Total node count is \(\sum_{k=0}^{h} d^k = (d^{h+1} - 1) / (d - 1)\) for d > 1, and h + 1 for d == 1.

Return type:

Topology

Parameters:

• depth (int)

• degree (int)