[Date Prev][Date Next][Thread Prev][Thread Next][Author Index][Date Index][Thread Index]
Re: [zzdev] Re: [zzdev] Re: [zzdev] Re: [zzdev] Re: [zzdev] gzigzag/Java ZZTreeRaster.java (fwd)
- To: zzdev@xxxxxxxxxx
- Subject: Re: [zzdev] Re: [zzdev] Re: [zzdev] Re: [zzdev] Re: [zzdev] gzigzag/Java ZZTreeRaster.java (fwd)
- From: Antti-Juhani Kaijanaho <gaia@xxxxxx>
- Date: Fri, 14 Jul 2000 17:17:03 +0300
- In-reply-to: <Pine.LNX.3.96.1000714095315.24614i-100000@fuga>; from lukka@xxxxxx on Fri, Jul 14, 2000 at 09:54:17AM +0300
- Mail-followup-to: zzdev@xxxxxxxxxx
- References: <20000714142002.H7245@xxxxxxxxxxx> <Pine.LNX.3.96.1000714095315.24614i-100000@fuga>
- Sender: Antti-Juhani Kaijanaho <ajk@xxxxxxxxxxx>
On Fri, Jul 14, 2000 at 09:54:17AM +0300, Tuomas J. Lukka wrote:
> What I mean is that you don't need to go as far as to find an actual "root".
> Just go up in the tree a couple of steps. (at least optionally).
Yeah... but in that case the ZZGraphics instance does not know of the
other cells and thus cannot draw any connections from a cell to a distant
cell not visible. The current system models the whole tree and tells
the ZZGraphics instance the positions of all cells, not merely of those
who are visible.
> Then it would be easy to do recursive trees, which would be useful
> e.g. for implementing & viewing finite-state machines...
The current one does cope with circularity in the "tree", if that's what
%%% Antti-Juhani Kaijanaho % gaia@xxxxxx % http://www.iki.fi/gaia/ %%%