Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Heap implementations: Fibonacci, Brodal and relaxed
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2009-01-12 (17:57)
From: Hugo Ferreira <hmf@i...>
Subject: Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed

blue storm wrote:
> First of all, do you know about Okasaki leftist heaps (I suppose you
> do as you're asking for even more advanced data structure) ? They're
> simple O(log n) heap, nice to implement (~ 20 lines).

Actually I didn't (although I know of these). But the thesis has a
better performing binomial heap.

> There was a page from Markus Mottl with translated OCaml code from the
> book, but he removed it for some obscure reason.

Still available (Chapter 6.):

Hugo F.

> _______________________________________________
> Caml-list mailing list. Subscription management:
> Archives:
> Beginner's list:
> Bug reports: