[Haskell-cafe] Fibonacci Heap without using Monad

larry.liuxinyu 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...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20101230/5be208a6/attachment.htm>

More information about the Haskell-Cafe mailing list