Create a new TreeGraph with the root node defined by the inputs.
The value for which to find the tree graph node reversal.
The maximum distance/orbit/branch length to travel.
Modulus used to devide n, iff n is equivalent to (0 mod P).
Factor by which to multiply n.
Value to add to the scaled value of n.
A TreeGraph, a tree with branches traversing the inverse function.
Contains the results of computing the Tree Graph via Collatz.treeGraph(~). Contains the root node of a tree of TreeGraphNode's.