[boost] Re: Memoization library

From: David Abrahams (dave_at_[hidden])
Date: 2003-12-14 12:49:03

Jim Apple <japple_at_[hidden]> writes:

>> 2. I've often wanted to use dynamic programming/memoization in a
>>    system where changes could invalidate part of the cache.  Think of
>>    a shortest path algorithm where a few pieces of the graph can
>>    change between invocations.  How would one accomodate that?
>
> I don't think I understand your problem. Is the graph a function
> parameter, or a global? 

I don't see why that matters.

> Does the graph stay the same through recursive calls, but change
> between top-level invocations,

Yes.

-- 
Dave Abrahams
Boost Consulting
www.boost-consulting.com