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

What is the advantages for linux, What is the advantages for Linux? ...

What is the advantages for Linux? Runs on old Hardware Low-Cost Linux is fully customizable in all its components Powerful Linux runs on low-end, cheap hardware

Define secondary memory, Define secondary memory. This memory holds tho...

Define secondary memory. This memory holds those pages that are not present in main memory. The secondary memory is usually a high speed disk. It is known as the swap evice, an

Describe five bit even parity checker, Describe five bit even parity checke...

Describe five bit even parity checker. Ans: Five bit even parity checker: EX-OR gates are utilized for checking the parity as they generate output 1, while the input ha

Development tools environment , Main Objectives: • MPLAB In-Circuit Debugg...

Main Objectives: • MPLAB In-Circuit Debugger (ICD 2) functionality • ICD 2 Connection design • MPLAB ICD 2 setup with the PC and Interface board designed • I²C Protocol buses tech

Define word length, Define word length?  Every group of n bits is refer...

Define word length?  Every group of n bits is referred to as a word of information and n is known as the word length.

How the information should be retrieved from the database, In a report with...

In a report with an LDB attribute, you do not have to explain how the information should be retrieved from the database tables, but only how the data should be shown on the screen.

Use of intrinsic functions in fortran, Q. Use of Intrinsic Functions in FOR...

Q. Use of Intrinsic Functions in FORTRAN? HPF initiates some new intrinsic functions also to those defined in F90. The two mainly often used in parallel programming are system

Explain approaches to reuse free memory area in a heap, Discuss two main ap...

Discuss two main approaches to reuse free memory area in a heap. Two major approaches to reuse free memory area in a heap are: First-fit: Allocate the first hole which i

Describe about the desk top publishing, Desk Top Publishing (DTP) As wo...

Desk Top Publishing (DTP) As word processors develop increasingly more sophisticated features, differences with desk top publishing (DTP) packages becomes more and more blurred

What do you understand by a file system, Problem (a) What do you mean...

Problem (a) What do you meant by a file system? (b) Mention the five categories of data for a basic file system reference model. What is the use of such a reference model

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