Difference between Breadth First Search, and Iterative deepening

Posted by theraven on Stack Overflow See other posts from Stack Overflow or by theraven
Published on 2010-06-08T00:54:58Z Indexed on 2010/06/08 1:02 UTC
Read the original article Hit count: 372

I understand BFS, and DFS, but for the life of me cannot figure out the difference between iterative deepening and BFS. Apparently Iterative deepening has the same memory usage as DFS, but I am unable to see how this is possible, as it just keeps expanding like BFS. If anyone can clarify that would be awesome.

tree to work on if required:

    A
   / \
  B   C
 /   / \
D   E   F

© Stack Overflow or respective owner

Related posts about search

Related posts about dfs