An arbitrary for a valid Prüfer code with the given node count, by default 3. An arbitrary for a Prüfer code must obey these laws:
3
nodeCount - 2
1 ≤ code ≤ nodeCount
The set of codes generated is in bijection with all vertex trees of nodeCount nodes.
nodeCount
The 1st Prüfer code is [] which decodes to the only possible vertex tree at node count 2:
[]
2
┬1 └─2 Copy
┬1 └─2
An arbitrary for a valid Prüfer code with the given node count, by default
3. An arbitrary for a Prüfer code must obey these laws:nodeCount - 2.1 ≤ code ≤ nodeCount.The set of codes generated is in bijection with all vertex trees of
nodeCountnodes.The 1st Prüfer code is
[]which decodes to the only possible vertex tree at node count2: