To: dougo@ccs.neu.edu, lieber@ccs.neu.edu
Subject: RE: intersection of strategies

Hi Doug:

that will be efficient enough and better in the long run.

It is efficient enough because the set of traversal graphs
will contain typically only two elements.
The strategies will be:

s = whereToGo * whatToCut // intersection

where the names of the strategies describe their intent.

Thank you for digging out algorithm 3!

-- Karl

>From dougo@ccs.neu.edu  Thu Jan 16 11:32:20 2003
>From: Doug Orleans <dougo@ccs.neu.edu>
>Date: Thu, 16 Jan 2003 11:32:18 -0500 (EST)
>To: <lieber@ccs.neu.edu>
>Subject: RE: intersection of strategies
>
>Karl Lieberherr writes:
> > Will you implement the approximate strategy intersection
> > discussed in the previous message?
>
>I think I would rather get it right, and implement Algorithm 3,
>traversing a set of traversal graphs in parallel.  I can use the
>Composite pattern for both strategies and traversal graphs.  I think
>that's better than having a compromise solution that gives the wrong
>answer sometimes.
>
>--Doug
>