Re: matrix encoding IS adjacency list
From: David Cressey <david.cressey_at_earthlink.net>
Date: Tue, 20 Sep 2005 13:55:07 GMT
Message-ID: <%wUXe.1156$vw6.58_at_newsread1.news.atl.earthlink.net>
Date: Tue, 20 Sep 2005 13:55:07 GMT
Message-ID: <%wUXe.1156$vw6.58_at_newsread1.news.atl.earthlink.net>
"vc" <boston103_at_hotmail.com> wrote in message
news:1127222137.298083.18680_at_g43g2000cwa.googlegroups.com...
>
> David Cressey wrote:
> > "Vadim Tropashko" <vadimtro_invalid_at_yahoo.com> wrote in message
> > news:1127168534.689248.131360_at_g43g2000cwa.googlegroups.com...
> >
> > > Trivial with adjacency list.
> >
> > What does this mean?
>
> ... finding all the children for a given node is easy with the
> adjacency list encoding:
Thanks, vc. That's what I thought.
I do not use "trivial" as a synonym for "easy".
There are too many things that are easy, but non-trivial. And, IMO, there are too many trivial things that are not easy. Received on Tue Sep 20 2005 - 15:55:07 CEST