Process of breadth first search, Computer Engineering

Process of Breadth first search:

It's very useful to think of this search as the evolution of the given tree, and how each string of letters of word is found via the search in a breadth first time. The numbers above the boxes specify at which step and why in the search the string was found. 

We see that there each node leads to three others which are connect, which according to this fact that after every step of this procedure, three further steps are may be put on this agenda. This is known as the branching rate of a search to specified, and acutely affects both how long a search is going to be take and why and how much memory it will use up. 

Breadth first search is an almost complete strategy for this kind of search: given enough period and memory for store, it will find a solution if one can exists. Unfortunately, this memory is a big type of problem for breadth first search. We can think for this how big the agenda grows, but in effect we are just counting the number of states which are still 'alive' for this ,  i.e., there are some still steps in the agenda for involving them. As it is clear in the above diagram, that states, which are still alive are those fewer than three arrows coming from them; obviously there are 14 in all. 

It's fairly easy to know that in a search with a branching rate of b, if we really want to search all the way into a depth of d, then the largest number of states will be the agent that will have to store at any one time is bd-1. For example, if our professor wanted to search for all the names up to length 8, than she would have to remember (or write down) 2187 on different strings to complete a breadth in first search. This is just because she would need to remember 37 strings of length 7 in order to be set and able to build all the strings of length 8 from them which are use. In searches with a higher type of branching rate, for the memory requirement can often become too large for an agent's processor as it require.

Posted Date: 1/9/2013 7:19:21 AM | Location : United States







Related Discussions:- Process of breadth first search, Assignment Help, Ask Question on Process of breadth first search, Get Answer, Expert's Help, Process of breadth first search Discussions

Write discussion on Process of breadth first search
Your posts are moderated
Related Questions
Design a circuit which computes the square of a number? This should not make use of any multiplier circuits. This should use Multiplexers and some other logic as: 1^2=0+1=1

Question: (a) (i) Explain properties of the WebService attribute. (ii) Discuss three properties of the WebMethod attribute. (b) What are WSDL documents used for? (c)

Explain the use of structures with pointers C permits a pointer to a structure variable. In fact a pointer to a structure is same to a pointer to any other variable. The pointe

Question : a) Describe the following modes of wave propagation: - Line of sight - Ground waves - Skywaves b) Why can waves with a very low frequency be used for submar

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

What is Cursor? Cursor is a database object used by applications to manipulate data in a set on a row-by- row basis, instead of the typical SQL commands that operate on all the

Creating a contacts application: First, a contact is defined as the tuple: firstName, lastName, phoneNumber and email. You will create a class Contact that allows getting a

a c program to implement multiple stack in a single array

What are the "field" and "chain" Statements? The FIELD and CHAIN flow logic statements let you Program your own checks. FIELD and CHAIN tell the system which fields you are ch

Draw a neat diagram to explain major components of a web browser. The Major Component of a Web browser A browser contains a set of clients, a controller and a set o