dbh 0 Report post Posted October 11, 2004 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. Share this post Link to post Share on other sites
logophobia 0 Report post Posted October 20, 2004 breadth first search googled :http://forums.xisto.com/no_longer_exists/ like pseudo code examples includedI hope this is what u are looking for Share this post Link to post Share on other sites
dbh 0 Report post Posted October 20, 2004 Hmm thanks a lot for the link.It's not so easy to understand the code though, but I get the idea. Share this post Link to post Share on other sites
