Re: DFS and BFS help please

On Jan 2, 8:27 am, Totti <saliba.toufic.geo...@xxxxxxxxx> wrote:
hi all, happy and succesfull new year to all of you.

i am wondering if anybody can help me clarify some things about graphs
theory.
does a DFS have always a standard result?
i mean i am trying to run a DFS from a site for a certain graph, when
i try to do it by my own using the same rules, starting from the same
starting point but let us say go 'down' instead of 'up', for example.
i get other results, is that ok? can one run a DFS as one wants?

what about BFS?

Probably, you want the news:comp.ai.* heirarchy.
See also:
http://en.wikipedia.org/wiki/Depth-first_search
http://en.wikipedia.org/wiki/Breadth-first_search

If you have a graph and you want to find something in it, alpha-beta
search is a good way to go.

http://en.wikipedia.org/wiki/Alpha-beta_pruning
.

Relevant Pages

  • Re: Next Generation of Language
    ... |>> algorithms are graph based and have to search a tree. ... |>> graph algorithms are inherently unparallelizable. ... | over any number of cores (supposing one doesn't care about exact DFS ...
    (comp.lang.lisp)
  • Re: [OT] Graph programming problem.
    ... > I believe the original poster needed to test if a graph were connected ... > or not, so DFS or BFS would not solve this problem, an algorithm such ... DFS and BFS ...
    (comp.lang.cpp)
  • Re: How to accomplish specialisation of Methods
    ... > where ClientOfGraph invokes a graph method and passes the appropriate A, ... Well, by now, as far as I can see one of the problem is that the client ... //Only BFS makes sense ... //Only DFS makes sense ...
    (comp.object)
  • Re: Depth First Search in Binary Search Tree?
    ... called "dfs" is beyond me. ... That's not the meaning of a depth-first search. ... This method means that you'll get all the way to the bottom of the tree down ... While a tree is a graph, and therefore can have DFS applied to it, it ...
    (comp.programming)
  • Re: Standard graph API?
    ... such traversals wouldn't really have to be part of the ... I've tried two different ways of writing a general purpose DFS with as ... = start of new DFS tree with root v ... with a graph argument and as part of its initialization performs a DFS ...
    (comp.lang.python)