Jump to content
xisto Community
Sign in to follow this  
dbh

Algorithm Help

Recommended Posts

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

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

×
×
  • Create New...

Important Information

Terms of Use | Privacy Policy | Guidelines | We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.