DFS (Depth First Search) and BFS(Breadth First Search) are self-explanatory. Next, go through the “depth first iterative deepening search”. (DFID)

There are lots of repeated work but DFID search doesn’t increase the asymptotic time complexity relative to BFS, and it has linear (as a function of path length k) space complexity.