[Haskell-cafe] Fibonacci Heap without using Monad
liuxinyu95 at gmail.com
Thu Dec 30 09:51:43 CET 2010
In CLRS, there are algorithms about DECREASE-KEY and DELETE-NODE.
However, in the Functional approach, I didn't find corresponding solution.
One approach may just mark the node as `deleted' and when pops the top
element from the heap, we repeat it until find a unmarked node.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe