Roger wrote: > In scalar-oriented languages an efficient way to solve this > problem can be described in 3 words: depth first search.
> none of the [J] solutions mentioned so far comes near. > [what the time and space should be] See: http://www.jsoftware.com/jwiki/DanBron/Temp/Tree -Dan ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
