| | Hi everyone I've been exposed to basic C++ programming and I am trying to learn some basic searching algorithms. I think I know how Depth First Search(DFS) works and how to implement it, but I am having difficulty with Breadth First Search(BFS) and Depth First Search with Iterative Deepening (ID). Can anyone explain how those two searching algorithms are used (in actual coding, or how do you actually implement them?) and what are their advantages and disadvantages? Thanks in advance. |

