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

Risks by customer perspective in electronic payment system, What are the ri...

What are the risks by customer's perspective in Electronic Payment Systems? Risks within Electronic Payment Systems: Through the customer's perspective are as follows:

How to work in dreamweaver?, HOW TO WORK IN DREAMWEAVER? How and Where ...

HOW TO WORK IN DREAMWEAVER? How and Where to open Dreamweaver? Step 1: Click on Start Step 2: Select Program Step 3: Select Macromedia Dreamweaver Step 4: Click on

What is called when a program is in execution, A program in execution is ca...

A program in execution is called?  Ans. When a program in execution is known as Process.

Design a sample counter, Let's design a synchronous BCD counter. A BCD coun...

Let's design a synchronous BCD counter. A BCD counter follows a sequence of ten states and returns to 0 after count of 9. These counters are also known as decade counters. This typ

How to select valid lines for secondary list, How to select valid lines for...

How to select valid lines for secondary list? To stop the user from selecting invalid lines, ABAP/4 offers various possibilities.  At the end of the processing block END-OF-SEL

Explain the term - computer aided software engineering, Explain the term - ...

Explain the term - Computer Aided Software Engineering Production of software became much commercial. Software development tools were devised. Concept of Computer Aided Softwar

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

What is a demultiplexer, What is a demultiplexer? Ans: Demultiplex...

What is a demultiplexer? Ans: Demultiplexer: This is a logic circuit which accepts one data input and distributes this over some outputs. This has one data input, m selec

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