From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from mail1-relais-roc.national.inria.fr (mail1-relais-roc.national.inria.fr [192.134.164.82]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id p5UE8NT1012323 for ; Thu, 30 Jun 2011 16:08:23 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AoMCAL6CDE7RVdg2kGdsb2JhbAA8AQMSG4Qnk3GPGQgUAQEBAQkJDQcUBCGrZotigwmEQYkhAgMGgSWDeoEMBJIvjBw8gTyCHA X-IronPort-AV: E=Sophos;i="4.65,450,1304287200"; d="scan'208";a="112258471" Received: from mail-qw0-f54.google.com ([209.85.216.54]) by mail1-smtp-roc.national.inria.fr with ESMTP/TLS/RC4-SHA; 30 Jun 2011 16:08:18 +0200 Received: by mail-qw0-f54.google.com with SMTP id 9so1968348qwc.27 for ; Thu, 30 Jun 2011 07:08:18 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=mime-version:sender:in-reply-to:references:from:date :x-google-sender-auth:message-id:subject:to:cc:content-type :content-transfer-encoding; bh=LNgQ34/GST35FvfoN1RXsMlUDGWumCtMdn9EtiRx200=; b=Oalch9RZ4tdSo4u2vd9uZ1+pysFzxqIu6oHfAuW4/2r+vENmfyMp2dBen70kd2z4sR 04JR9iZiVQThveG4UTV9bgZiVQHhXhWt1nQzcwLqeWgwzkaX0VAidRQsC21m3GR1Y6Uu UZFzXFEh2bYVEBsJvNu68BsCK8nKsniwkt0sk= Received: by 10.224.201.136 with SMTP id fa8mr1483685qab.329.1309442896082; Thu, 30 Jun 2011 07:08:16 -0700 (PDT) MIME-Version: 1.0 Sender: dapilki@gmail.com Received: by 10.224.39.9 with HTTP; Thu, 30 Jun 2011 07:07:56 -0700 (PDT) In-Reply-To: <4E0C77EF.6030408@elehack.net> References: <4E0C5E67.9010606@gmail.com> <4E0C6D2E.8070206@lri.fr> <4E0C77EF.6030408@elehack.net> From: Alexandre Pilkiewicz Date: Thu, 30 Jun 2011 16:07:56 +0200 X-Google-Sender-Auth: DXygBZEhMBn_OEc6XdW8mko1JrA Message-ID: To: Michael Ekstrand Cc: caml-list@inria.fr Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by walapai.inria.fr id p5UE8NT1012323 Subject: Re: [Caml-list] Priority queues 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 : > 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 > >