From mboxrd@z Thu Jan 1 00:00:00 1970 Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id p5UEMZbK013303 for ; Thu, 30 Jun 2011 16:22:35 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ArsFADGGDE7Cpx5egWdsb2JhbABShEKUJI5uFAEBFiYliHquV5BwgSuDeoEMBKJf X-IronPort-AV: E=Sophos;i="4.65,450,1304287200"; d="scan'208";a="97734118" Received: from sucre.univ-orleans.fr ([194.167.30.94]) by mail2-smtp-roc.national.inria.fr with ESMTP; 30 Jun 2011 16:22:17 +0200 Received: from localhost (localhost [127.0.0.1]) by sucre.univ-orleans.fr (Postfix) with ESMTP id B3C87943D2 for ; Thu, 30 Jun 2011 16:22:22 +0200 (CEST) Received: from sucre.univ-orleans.fr ([127.0.0.1]) by localhost (sucre.univ-orleans.fr [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id xiXqN0i5MRe0 for ; Thu, 30 Jun 2011 16:22:22 +0200 (CEST) Received: from smtps.univ-orleans.fr (smtps.univ-orleans.fr [194.167.30.152]) by sucre.univ-orleans.fr (Postfix) with ESMTP id 98E8A943CB for ; Thu, 30 Jun 2011 16:22:22 +0200 (CEST) Received: from Erdos.local (dau94-10-88-189-211-192.fbx.proxad.net [88.189.211.192]) by smtps.univ-orleans.fr (Postfix) with ESMTP id 3268436E60 for ; Thu, 30 Jun 2011 16:22:19 +0200 (CEST) Message-ID: <4E0C8697.8070805@ens-lyon.org> Date: Thu, 30 Jun 2011 16:22:15 +0200 From: David Rajchenbach-Teller User-Agent: Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; en-US; rv:1.9.2.18) Gecko/20110616 Thunderbird/3.1.11 MIME-Version: 1.0 To: caml-list@inria.fr References: <4E0C5E67.9010606@gmail.com> <4E0C6D2E.8070206@lri.fr> <4E0C77EF.6030408@elehack.net> In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Subject: Re: [Caml-list] Priority queues On 6/30/11 4:07 PM, Alexandre Pilkiewicz wrote: > 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 Are we talking about Dijkstra's graph traversal algorithm? If so, there is no need to increase/decrease anything. Best regards, David