Getting QueueSize and MaxQueueSize for IterativeDeepeningSearch and DepthLimitedSearch about aima-java

[RuedigerLunde]

Hi,
DLS and IDS implement a kind of DFS recursively. They do not use any queue. So, space consumption only depends on the stack size of the VM. Of course, a queue-based DFS variant could be used/implemented instead. In this case, every node should store its depth. Otherwise, the needed depth test would have a negative impact on time complexity. To add such an implementation to the existing library, one could create an own NodeFactory by subclassing the existing one and use an own node class with an additional attribute depth.

Best regards,
Rüdiger