I have the impression that none of the proposed solution allows to increase/reduce the priority of an element, which is necessary for the Dijkstra. (But I don't know any that does)
- Alexandre 2011/6/30 Michael Ekstrand <[email protected]>: > On 06/30/2011 07:33 AM, Jean-Christophe Filliātre wrote: >> I have an implementation of priority queues on my web page: >> >> http://www.lri.fr/~filliatr/software.en.html >> >> Look for "heap". Note that it contains 2 implementations: one imperative >> and one persistent. Help yourself > > I've used this heap implementation with good success. > > Batteries Included also contains a heap implementation (BatHeap) - if > the OP is using Batteries, he can just use that heap as well. > > - Michael > > -- > Caml-list mailing list. Subscription management and archives: > https://sympa-roc.inria.fr/wws/info/caml-list > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > Bug reports: http://caml.inria.fr/bin/caml-bugs > > -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
