Difference between depth first and breadth first traversing, Computer Engineering

Assignment Help:

Explain the difference between depth first and breadth first traversing techniques of a graph.  

Depth-first search is dissimilar from Breadth-first search in the following ways: A depth search traversal method goes to the deepest level of the tree first and then works up whereas a breadth-first search looks at all possible paths at the similar depth before it goes to a deeper level. When we come to a dead end in a depth-first search, we back up as little as possible. We try another route from a new vertex-the route on top of our stack. In a breadth-first search, we need to back up as far as possible to search a route originating from the previous vertices. So the stack is not an appropriate structure for searching an early route because it keeps track of things in the order opposite of their occurrence-the new route is on top. To keep track of things in the order in which they happened, we use a FIFO queue. The route at the front of the queue is a route from an previous vertex; the route at the back of the queue is from a later vertex.

 


Related Discussions:- Difference between depth first and breadth first traversing

replacing option of a copy statement, What is the point of the REPLACING o...

What is the point of the REPLACING option of a copy statement? Ans) REPLACING permits for the similar copy to be used more than once in the similar code by changing the replac

What is master slave kernel, Q. What is Master slave kernel? Master sl...

Q. What is Master slave kernel? Master slave kernel: In this model just one of processors is assigned as Master.  The master is in charge for subsequent activities:  i)

Determine the factor consider when selecting digital encoder, 1. What facto...

1. What factors should be considered when selecting a digital encoder (line codes)? Briefly mention five of those factors. Use sketches and additional text to describe the followin

Visibility, hidden edge/surface removal

hidden edge/surface removal

When is a memory unit called as ram, When is a memory unit called as RAM? ...

When is a memory unit called as RAM? A memory unit is called as RAM if any location can be accessed for a read or writes operation in some fixed quantity of time that is indepe

Associative memory organisations, Associative Memory Organisations The ...

Associative Memory Organisations The associative memory is organised in w words with b bits per word. In w x b array, every bit is known a cell. Each cell is made up of a flip-

What is control store, What is control store? The microroutines for all...

What is control store? The microroutines for all the instructions in the instruction set of a computer are kept in a special memory known as the control store.

State about the machine language programs, State about the machine language...

State about the machine language programs The computer can run only machine language programs, one needs to translate above programs to machine language programs. To translate

What are advantages and drawbacks of latches, What are advantages and drawb...

What are advantages and drawbacks of latches? Advantages and drawbacks of latches: Area of a latch is classically less than a Flip Flop. It consumes less power, becaus

i use server session pools and connection consumers, When should I use ser...

When should I use server session pools and connection consumers? Ans) WebLogic JMS executes an optional JMS facility for defining a server-managed pool of server sessions. This

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd