I saw a question about "Iterative Deepening Depth-First Search" and I couldn't any answer. If it exists, I am sorry for that.
Question: How does the complexity of IDS change when the graph is used instead of tree?
Thank you!
Asked
Active
Viewed 114 times
1
-
What graph? what tree? – Luke Garrigan Oct 24 '17 at 10:26
-
Not a specific tree or graph. I guess, it is a general question that compare graph search and tree search. Also, there is no additional information in the question. – Can Oct 24 '17 at 21:02