Newsgroups: comp.lang.apl
Path: watmath!watserv2.uwaterloo.ca!torn!utcsri!rpi!usenet.coe.montana.edu!saimiri.primate.wisc.edu!sdd.hp.com!spool.mu.edu!umn.edu!csus.edu!sfsuvax1.sfsu.edu!emclean
From: emclean@sfsuvax1.sfsu.edu (Emmett McLean)
Subject: Seek examples of BFS or DFS and implementation of tree DS
Message-ID: <1992Dec17.223402.1810@csus.edu>
Sender: news@csus.edu
Organization: San Francisco State University
Distribution: NA
Date: Thu, 17 Dec 1992 22:34:02 GMT
Lines: 17

It would be nice to know how to implement a tree and 
execute depth first search or breath first search 
in J.  (RR's example in his docify program is about
the closest thing I've seen.)  Postfix or infix traversal
of a tree would be nice to see also.

Does anyone have any examples ?

It may be that a knowledgable programmer could implement
BFS type algorithms without using a tree data structure.
But some programmers would be sceptical, and besides,
"inquiring minds want to know" -:).

Thanks,
Emmett
   
emclean@sfsuvax1.sfsu.edu
