From lieber@ccs.neu.edu Sat Dec  5 20:39:57 1998
To: bdelav@hotmail.com, lieber@ccs.neu.edu
Subject: Re:  TraversalGraph interface
Cc: dougo@ccs.neu.edu

Hi Bill:

if you flatten the class graph then
alternation edge = inheritence edge in reverse
Traversals go in the direction of the alternation edges.

However, Doug does not flatten the class graphs and
that makes the interface of the library significantly more complex.
You have to go down alternation edges 
and up inheritance edges at the class graph level.

Doug: do you want AP Library users to know about knowledge paths?
(page 176, 177 of my book)
That makes the library harder to use.

Repetition edges are not there, I guess, because they are viewed
as construction edges with a cardinality.

Doug has more detail. 

-- Karl

>From bdelav@hotmail.com Sat Dec  5 08:28:22 1998
>From: "Bill de la Vega" <bdelav@hotmail.com>
>To: lieber@ccs.neu.edu
>Cc: dougo@ccs.neu.edu
>Subject: TraversalGraph interface
>
>TraversalGraph contains methods hasConstructionEdge, hasAlternationEdge, 
>& hasInheritanceEdge. 
>
>I thought 'Alternation' was a synonym for 'Inheritance' and I was 
>expecting a method hasRepetitionEdge. Is this a mistake in the interface 
>or am I not understanding something?
>
>Thanks.
>
>
>______________________________________________________
>Get Your Private, Free Email at http://www.hotmail.com
>