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 do you meant by an expert system, (a) What do you meant by an Expert S...

(a) What do you meant by an Expert System (ES) and explain briefly the essential differences between a Decision Support system and ES. (b) What are decision tables and what are

Describe big notation, Q. Describe Big Notation? Big O Notation : The ...

Q. Describe Big Notation? Big O Notation : The set O (g(n)) comprises all functions f(n) for that there exists   positive constants c such that for satisfactorily large values

What are the two levels in defining a match code, What are the two levels i...

What are the two levels in defining a Match Code? Match Code Object. Match Code Id.

Describe data parallel model, Describe Data Parallel Model? In data par...

Describe Data Parallel Model? In data parallel model most of parallel work concentrates on performing operations on a data set. Data set is characteristically organised in a co

Describe program control instructions, Q. Describe Program Control Instruct...

Q. Describe Program Control Instructions? These instructions specify conditions for altering the sequence of program execution or we can say in other words that the content of

List the key notions concerning macro expansion, List the key notions conce...

List the key notions concerning macro expansion. Two key notions relating to macro expansion is: 1. Expansion time control flow- Determines the order of model statements tha

What is meant by a priority encoder, What is meant by a priority encoder? ...

What is meant by a priority encoder? Ans: Priority encoder- Basically an encoder is a combinational circuit which performs the inverse operation of a decoder. The input c

State about the behavioral modeling, State about the Behavioral modeling ...

State about the Behavioral modeling Behavioral means how hardware behaves determine exact way it works we write using HDL syntax. For complex projects it's better mixed approac

Handling interrupts - computer architecture, Handling Interrupts: Pre...

Handling Interrupts: Precise interrupts (sequential semantics) Complete instructions before the offending instructions o   Force trap instruction into IF o

Build data flow diagrams showing functional dependencies, Build data Flow d...

Build data Flow diagrams showing functional dependencies Data flow diagrams are very useful for showing functional dependencies. In data flow diagrams processes are indicated

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