C Programming

The Difference Between

Artificial Intelligence

# What is the difference between depth first and breadth first search in data structures?

###### Wiki User

###### 2016-03-17 13:53:46

The main difference is that with depth first we use a stack to

backtrack and with breadth first we use a queue. Which method we

use is ultimately determined by the ordering of the tree.

## Related Questions

###### Asked in The Difference Between, Artificial Intelligence

### What is the difference between breadth first search and depth first search in C programming?

Both algoritms can be build very similary. The difference
between breadth-first search and depth-first search is order in
which elements ar added to OPEN list. In breadth-first search new
nodes are appended to the end of OPEN list
In depth-first search new nodes are inserted in the begining of
OPEN list

###### Asked in Java Programming, C Programming, C++ Programming

### What is the difference between breadth first search and depth first search?

Both algorithm can be build very similar. The difference between
breadth first search and depth first search is order in which
element are added to open list.
In Breadth First Search :- A new node are appended
to the end of open list.
in addition it needs Memory Space.
In Depth First Search :- A new node are inserted in the
beginning of open list.

###### Asked in Computer Hardware, College Applications and Entrance Requirements, C Programming, The Difference Between

### What is the advantage of iterative deepening search over depth-first?

Iterative deepening effectively performs a breadth-first search
in a way that requires much less memory than breadth-first search
does.
So before explaining the advantage of iterative deepening over
depth-first, its important to understand the difference between
breadth-first and depth-first search. Depth first explores down the
tree first while breadth-first explores all nodes on the first
level, then the second level, then the third level, and so on.
Breadth-first search is ideal in situations where the answer is
near the top of the tree and Depth-first search works well when the
goal node is near the bottom of the tree. Depth-first search has
much lower memory requirements.
Iterative deepening works by running depth-first search
repeatedly with a growing constraint on how deep to explore the
tree. This gives you you a search that is effectively breadth-first
with the low memory requirements of depth-first search.
Different applications call for different types of search, so
there's not one that is always better than any other.

###### Asked in Search Engine Optimization, Search Engines

### What is the difference between blind search and heuristic search?

Heuristic search algorithms have knowledge of where the goal or
finish of the graph. For example, in a maze, they would know which
path leads in the direction of the goal. Blind search algorithms
have no knowledge of where the goal is, and wander "blindly"
through the graph.
Blind search techniques include Breadth-first, Depth-first
search, etc.
Heuristic search techniques include Best-first, A*, etc.

###### Asked in Computers, Artificial Intelligence

### Difference between breadth first search and best first search in artificial intelligence?

These are the two search strategies which are quite similar.In
breadth first search a node is expanded according to the cost
function of the parent node. In best first search we expand the
nodes in accordance with the evaluation function.This can be
understood by the given example.
Suppose we are at two intermediate nodes N1 & N2.The cost
function of N1 is less than that of N2.So the breadth first
search will definitely expand N1.Now suppose somehow we have
the knowledge about the cost required from reaching goal
node from N1 and N2.If the sum of the costs of reaching N1 from
Start node and the cost (knowledge) of reaching goal from N1
is more than that of the sum of the costs of reaching N2 from Start
node and the cost (knowledge) of reaching goal from N2 ,
then we should expand N2 and not N1.This expansion is done in
Best first search