The tree enumeration can be both time and memory consuming, so it would be helpful to have stopping criteria if some limits are exceeded. The resulting count would be a lower bound, the resulting multitree would contain unexplored nodes.
The tree enumeration can be both time and memory consuming, so it would be helpful to have stopping criteria if some limits are exceeded.
The resulting count would be a lower bound, the resulting multitree would contain unexplored nodes.