0
3.2kviews
written 4.8 years ago by |
The problem of unbounded trees can be alleviated by supplying DFS with predetermined depth limit L. that is, nodes at depth L are treated as if they have no successors. This approach is called depth limited search. The depth limit solves the infinite path problem.
Unfortunately, it also introduces an …