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

Assessing heuristic searches-artificial intelligence, Assessing Heuristic S...

Assessing Heuristic Searches Given a specific problem you want to create an agent to solve, there can be more than one way of specifying it as a search problem, more than one o

DW, Define a job scheduling strategy that will meet business requirement of...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes

Length property of array , DEscribe a console application to show all the a...

DEscribe a console application to show all the arguments passed tocommand line whereas running the application. The user can pass anynumber of arguments that should be shown. Use l

Write the truth table and simplify karnaugh map, For F = A.B.C + B.C.D ...

For F = A.B.C + B.C.D ‾ + A‾.B.C ,  write  the  truth  table and simplify using Karnaugh map . And. Simplification of Logic Function F = A B C + B C‾ D + A‾ B C. Therefore the

Explain naming convention scripts, Explanation:- A script within Rationa...

Explanation:- A script within Rational Robot is a file that haves a sequence of SQABasic code. The extension of the file is always ".REC". Syntax [FEATURE] + "_" + [FUNCTION

What are the central interfaces of the r/3 system, What are the central int...

What are the central interfaces of the R/3 system? There are three central interfaces:- Presentation Interface. Database Interface. Operating system Interface.

Post interrupts - computer architecture, Post interrupts - computer archite...

Post interrupts - computer architecture: Post interrupts Exact interrupts examine interrupt bit on entering WB Longer latency Handle immediately

Distinguish between min terms and max terms, Distinguish between min terms ...

Distinguish between min terms and max terms. Ans Differentiate between Minterms and Maxterms: a. Each single term in standard Sum Of Products (SOP) form is termed as minterm

What are the input devices, What are the Input devices Various devices ...

What are the Input devices Various devices are available for data input on graphics workstations. Most systems have a keyboard and one or more additional devices specially desi

Explain how the different access methods work, Question: (a) Primary an...

Question: (a) Primary and secondary memory differs in their way they access data: (i) Mention the four generic access methods usually present in a computer system. (ii) E

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