10 Sep
2011
10 Sep
'11
7:05 p.m.
On Sep 10, 2011, at 1:31 PM, Jeremiah Willcock <jewillco@osl.iu.edu> wrote:
On Fri, 9 Sep 2011, Gordon Woodhull wrote:
(snip)
I am looking at porting various Boost.Graph algorithms to my proposed MPL.Graph. Do I understand that monads will help me define metadata structures like heaps and forests that don't seem to "map" easily to functional programming?
Slightly off-topic, but related: another approach to that problem is to use purely functional data structures.
Thanks for the references, Jeremiah! Cheers, Gordon