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

Minimax algorithm - artificial intelligence, Minimax algorithm - artificial...

Minimax algorithm - artificial intelligence: The minimax algorithm is so called because it assumes that you and your opponent are going to act rationally, so that if you will

Simplify pos expression, Q. For function F(X, Y, Z) = ∑(1, 2, 3, 5, 6) usin...

Q. For function F(X, Y, Z) = ∑(1, 2, 3, 5, 6) using TRUTH TABLE only 1.  Find POS expression 2.  Simplify POS expression 3.  Implement this simplified expression using t

Steps uesd in quine mckluskey method, Q. Steps uesd in quine mckluskey meth...

Q. Steps uesd in quine mckluskey method? Step I: Build a table in that every term of expression is represented in row (Expression must be in SOP form). Terms can be expres

De morgan''s laws - artificial intelligence, De Morgan's Laws Continuin...

De Morgan's Laws Continuing with the relationship between  ∧  and  ∨ , we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these conne

++ c, how to find the integral of a function represented by collection of e...

how to find the integral of a function represented by collection of experimental data

What is parallel loop construct, Q. What is Parallel Loop Construct? Pa...

Q. What is Parallel Loop Construct? Parallel loop construct is a shortcut for specifying parallel construct comprising one loop construct and no other statements. The syntax of

Write 8086 initialisation routine required to program 8255, Write 8086 init...

Write 8086 initialisation routine required to program 8255 for mode 1 with Port A and Port B as output Ports and Port C as an input port. Indicate all the relevant signals.

Analysis of sort bitonic, Analysis of Sort_Bitonic(X) The bitonic sorti...

Analysis of Sort_Bitonic(X) The bitonic sorting network needs log n number of phases for performing task of sorting the numbers. The first n-1 phases of circuit can sort two n/

Write a menu driven program to perform addition, Q. Write a menu driven pr...

Q. Write a menu driven program to perform addition and subtraction in base 5. Check that entered numbers are in base 5 or not else error message should be displayed.

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