From: Andy Vu
Subject: Depth-First-Search
Date: Fri, 16 Jan 1998 00:00:00 +0000
Message-ID: <34BF978D.AF8B2381@mail.bancard.com>

Can someone point me to anywhere has algorithm or source code about
Depth-First-Search???

• Re: Depth-First-Search Barry Margolin
• Re: Depth-First-Search ··········@neodesic.com

From: Barry Margolin
Subject: Re: Depth-First-Search
Date: Fri, 16 Jan 1998 00:00:00 +0000
Message-ID: <W7Pv.49$5F2.575651@cam-news-reader1.bbnplanet.com>

In article <·················@mail.bancard.com>,
Andy Vu  <···@mail.bancard.com> wrote:
>Can someone point me to anywhere has algorithm or source code about
>Depth-First-Search???

I'll bet you can find the algorithm in Knuth.

Actually, the algorithm is pretty trivial, I think I can put it right here:

If current node has children
   then for each child node
            recurse on the child node
If the current node satisfies the search criteria
   then process it

-- 
Barry Margolin, ······@bbnplanet.com
GTE Internetworking, Powered by BBN, Cambridge, MA
Support the anti-spam movement; see <http://www.cauce.org/>
Please don't send technical questions directly to me, post them to newsgroups.

From: ··········@neodesic.com
Subject: Re: Depth-First-Search
Date: Sat, 17 Jan 1998 00:00:00 +0000
Message-ID: <885079020.2039021576@dejanews.com>

In article <·················@mail.bancard.com>,
  Andy Vu <···@mail.bancard.com> wrote:
>
> Can someone point me to anywhere has algorithm or source code about
> Depth-First-Search???

One good place is Peter Norvig's "Paradigms of Artificial Intelligence
Programming," section 6.4, "A set of searching tools." See www.norvig.com.

-------------------==== Posted via Deja News ====-----------------------
      http://www.dejanews.com/     Search, Read, Post to Usenet