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

Classes of experts system, 1. The Consultant : A consultant is an experts...

1. The Consultant : A consultant is an experts person who possesses a high level of expertise in the area. He guide and educate the executives regarding establishing the e

State the web server security through ssl, Web server security through SSL ...

Web server security through SSL (Secure Socket Layer) As it is well known that the Intranets and internet are purely based on use of powerful web servers to deliver information

Define coupling, Define Coupling? Coupling means the measure of interco...

Define Coupling? Coupling means the measure of interconnection between modules in a program structure. It depends on the interface problem between modules.

Define class np, Define class NP. Problems that can be solved in polyn...

Define class NP. Problems that can be solved in polynomial time by a nondeterministic TM. Contains all problems   in P and some problems possibly outside P.

Routines which handle dynamic processes, Q. Routines which handle dynamic p...

Q. Routines which handle dynamic processes? number of routines which handle dynamic processes:  int pvm_joingroup( char *group ) Enrolls calling process in a na

Mpi, write an8086 alp to exchange a block of N bytes of data between sourc...

write an8086 alp to exchange a block of N bytes of data between source and destination

Define briefly about extranet, Define briefly about Extranet. Extrane...

Define briefly about Extranet. Extranet: Extranet is Extension of an Intranet which makes the latter available to outside companies or individuals along with or without

Explain call completion rate in telephone traffic, With reference to teleph...

With reference to telephone traffic, explain the terms CCR. CCR: Call completion rate is explained as the ratio of the number of successful calls to the number of call attemp

Explain in detail about the random scan display, Explain in detail about th...

Explain in detail about the Random Scan Display   This device using CRT directs the electron beam only to the parts of the screen where a picture is to be drawn. This kind of d

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