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

Explain the access methods used in lans, Explain the access methods used in...

Explain the access methods used in LANs. Access methods utilized in LAN: i. Switched access: this is used in LANs which are assigned around CBXs. Electronic switching

Explain simple telephone communication system, Explain simple telephone com...

Explain simple telephone communication system with circuit and equation of current flow in microphone? Simple Telephone Communication: In the simplest type of a telephone cir

Automated injection, There are tools to automate the process of SQL Injecti...

There are tools to automate the process of SQL Injection into login and other fields. One hacker process, using a one tool, will be to search out a number of weak targets using Goo

Define clock rate, Define clock rate? The clock rate is given by, R=1/P...

Define clock rate? The clock rate is given by, R=1/P, where P is the length of single clock cycle.

What are null values, What are null values? If the value of a field in ...

What are null values? If the value of a field in a table is indeterminate or unknown, it is known as a null value.

Environments -artificial intelligence, Environments: We have seen that...

Environments: We have seen that an agents intelligent should take into account certain information when it choose a rational action, including information from its sensors, in

Enumerate data structures used during 1-pass of assembler, Enumerate the da...

Enumerate the data structures used during the first pass of the assembler. Indicate the fields of these data structures and their purpose/usage. Three main data structures used

Recursion to an iterative procedure, The data structure required to convert...

The data structure required to convert a recursion to an iterative procedure is  Stack is the data structure required to convert a recursion to an iterative procedure

How physical addressing is performed in wan, How physical addressing is per...

How physical addressing is performed in WAN?  WAN networks operate as similar to a LAN. All WAN technology describes the specific frame format a computer uses while sending an

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