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

Explain excess-3 and gray code using four binary digitis, Give the details ...

Give the details of excess 3 codes and gray code using four binary digits. Ans: Table of excess 3 codes and gray code using four binary digits Binary

State the difference between following, Q. State the difference between fo...

Q. State the difference between following. i. RAM and ROM ii. SRAM and DRAM iii. Dynamic and static MOS memories

Find point-to-point link required in fully connected network, The number of...

The number of point to point links required in a fully connected network for 50 entities is? The number of point to point links needed in a completely connected network for 50

Linear array-various interconnection networks-fully connecte, Linear Array ...

Linear Array This is a mainly fundamental interconnection pattern.  In this processors are linked in a linear one-dimensional array. The intial and last processors are linked w

How does VB.NET achieve polymorphism, How does VB.NET/C# achieve polymorphi...

How does VB.NET/C# achieve polymorphism?  VB.Net / C# give polymorphism through the following mechanisms: 1. Inheritance - base class gives overridable methods which are re-

Structure of 8086 cpu, 8086 microprocessor comprises two independent units:...

8086 microprocessor comprises two independent units:  1.  Bus Interface unit 2.  Execution unit Please refer to Figure below. Figure: The CPU of INTEL 8086 Microp

Define in detail about the architecture, Define in detail about the Archite...

Define in detail about the Architecture Architecture is the set of resources visible to machine language programmer: Registers, the memory, data representations, instructions

Utilization summary, Utilization Summary The Utilization Summary shows ...

Utilization Summary The Utilization Summary shows the status of each processor i.e. how much time (in the form of percentage) have been spent by every processor in busy mode, o

Electrically erasable programmable rom - computer memory, Explain Electrica...

Explain Electrically Erasable Programmable ROM - Computer Memory? The next level of erasability is the EEPROM which able to be erased under software control. This is the most f

Types of classification-classification of parallel computers, Types Of Clas...

Types Of Classification The following classification of parallel computers have been recognized: 1)      Categorization based on the data streams and instruction 2)

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