Subject: Re: How to construct a tree from a given structure and elements

From: [email-masked] (Uwe Lesta)
Date: Wed, 06 Dec 2000 01:01:12 +0100

"Richard A. O'Keefe" schrieb:
 
>         > How is the order of a node's children to be determined?
> 
>             There is no order of the children.
> 
> No, the children of a tree represented by a Prolog term
> cannot help but be in *some* order.  

Sure, you are right. At a specific time every thing is in a order
even we could't see it.

> If the problem does not
> specify a natural order, is there something about the processing
> that suggests a natural order (perhaps ascending or descending
> order of weight?), or would any arbitrary order suffice?

In my mind the order of construction is a good (and natural) one, 
but any order would suffice. The question of order depends on the
reason to look at a tree.

Think of a hierarchic computer network. 
The administrator likes a view in the order of adress ranges.
The manager search by names and
the programmer like to see the machine with maximum resources first.

But most important is stability and expansion. 
So weight balanced is the main goal.

In my opinion the definition of weight is more important also
to describe it explicit. Assume the weight is described by
the green_points or by max_childs or any combination of red_
and green_points and max_childs. 

-- 

Regards

Uwe
[email-masked]