breadth first or depth first search

Posted by endroix on Stack Overflow See other posts from Stack Overflow or by endroix
Published on 2010-05-12T19:33:10Z Indexed on 2010/05/12 19:34 UTC
Read the original article Hit count: 372

Filed under:

breadth-first-search

|

depth-first-search

|

algorithm

|

c++

I know how this algorithm works, but cant decide when to use which algorithm ? Are there some guidelines, where one better perform than other or any considerations ? Thanks very much.

© Stack Overflow or respective owner

Related posts about breadth-first-search

Difference between Breadth First Search, and Iterative deepening

as seen on Stack Overflow - Search for 'Stack Overflow'
I understand BFS, and DFS, but for the life of me cannot figure out the difference between iterative deepening and BFS. Apparently Iterative deepening has the same memory usage as DFS, but I am unable to see how this is possible, as it just keeps expanding like BFS. If anyone can clarify that would… >>> More
Breadth first search all paths

as seen on Stack Overflow - Search for 'Stack Overflow'
First of all, thank you for looking at this question. For a school assignment we're supposed to create a BFS algorithm and use it to do various things. One of these things is that we're supposed to find all of the paths between the root and the goal nodes of a graph. I have no idea how to do… >>> More
Improving the running time of Breadth First Search and Adjacency List creation

as seen on Programmers - Search for 'Programmers'
We are given an array of integers where all elements are between 0-9. have to start from the 1st position and reach end in minimum no of moves such that we can from an index i move 1 position back and forward i.e i-1 and i+1 and jump to any index having the same value as index i. Time Limit : 1 second Max… >>> More
Performing Breadth First Search recursively

as seen on Stack Overflow - Search for 'Stack Overflow'
Let's say you wanted to implement a breadth-first search of a binary tree recursively. How would you go about it? Is it possible using only the call-stack as auxiliary storage? >>> More
Breadth First Search and Depth First Search

as seen on Stack Overflow - Search for 'Stack Overflow'
Can anybody give a link for a simple explanation on BFS and DFS with its implementation? >>> More

Related posts about depth-first-search

Depth First Search Basics

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to improve my current algorithm for the 8 Queens problem, and this is the first time I'm really dealing with algorithm design/algorithms. I want to implement a depth-first search combined with a permutation of the different Y values described here: http://en.wikipedia.org/wiki/Eight_queens_puzzle#The_eight_queens_puzzle_as_an_exercise_in_algorithm_design I've… >>> More
breadth first or depth first search

as seen on Stack Overflow - Search for 'Stack Overflow'
I know how this algorithm works, but cant decide when to use which algorithm ? Are there some guidelines, where one better perform than other or any considerations ? Thanks very much. >>> More
Scheme Depth-first search of a graph function

as seen on Stack Overflow - Search for 'Stack Overflow'
This is a homework question,I'm trying to do a Depth-first search function in Scheme,Here's the code I've written so far: (define explore (?(node visited) (let* ([neighbors (force (cdr node))] [next (nextNode visited neighbors)] [is-visited (member… >>> More
minimax depth first search game tree

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi I want to build a game tree for nine men's morris game. I want to apply minimax algorithm on the tree for doing node evaluations. Minimax uses DFS to evaluate nodes. So should I build the tree first upto a given depth and then apply minimax or can the process of building the tree and evaluation… >>> More
Breadth First Search and Depth First Search

as seen on Stack Overflow - Search for 'Stack Overflow'
Can anybody give a link for a simple explanation on BFS and DFS with its implementation? >>> More