English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

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 (10:22)
From: Hugo Ferreira <hmf@i...>
Subject: Heap implementations: Fibonacci, Brodal and relaxed
Hello,

I would like to now if anyone has or knows of
functional implementations of priority (aka Min,
aka Max) heaps. Specifically I am looking for:

Fibonacci, Brodal and relaxed heaps [1]

with fast insert and deletes.

Any literature or implementation in Haskell
or F# are also welcome.

I also would appreciate any additional comments on
implementation issues and experience with heaps
that may help me.

TIA,
Hugo Ferreira.


[1] http://en.wikipedia.org/wiki/Fibonacci_heap