On 12 Jul 2001, Juliusz Chroboczek wrote:
> RdB> A tree has key values on each node which label the various child nodes,
>
> Not in my community.
>
> A tree is a directed acyclic graph in which every vertex has at most
> one predecessor and at most one vertex has no predecessor.
>
> Trees with additional data associated either to the vertices or the
> edges (such as the two kinds you've described) are still called trees.
>
> Trust me, we're speaking of exactly the same data structure.
Fine, but I still think somebody would be very disappointed if you said you
were using a tree and then showed them a linked list - it's a DAG too and
passes those rules.
It sounds like you're in a mathematical community, IME the jargon is
slightly different than you need with computer people who tend to stop
extrapolating when they hit the boundries between different orders of
computational complexity.
ObUTF8: I've heard of a 'guru' locale that uses lots of English computer
jargon, but can't find any proper references, does anyone know
where I can find it? IMO it sounds like a good candidate for
the first locale to go fully UTF-8, especially as it's basically
English but there's no real 'standard' to limit the gratuitous
translations you can add.
--
Rob. (Robert de Bath <robert$ @ debath.co.uk>)
<http://www.cix.co.uk/~mayday>
-
Linux-UTF8: i18n of Linux on all levels
Archive: http://mail.nl.linux.org/linux-utf8/
