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 p5UBUsUQ002714
	for <caml-list@sympa-roc.inria.fr>; Thu, 30 Jun 2011 13:30:54 +0200
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: AukCACRdDE5KfVK2kGdsb2JhbAA8AQMSmGaOZQgUAQEBAQkJDQcUBCGIep8+glCMIIJLhFU5iGgCAwaGKwSSL4R2gRyGCjyDWA
X-IronPort-AV: E=Sophos;i="4.65,449,1304287200"; 
   d="scan'208";a="112244177"
Received: from mail-wy0-f182.google.com ([74.125.82.182])
  by mail1-smtp-roc.national.inria.fr with ESMTP/TLS/RC4-SHA; 30 Jun 2011 13:30:49 +0200
Received: by wyg24 with SMTP id 24so2634292wyg.27
        for <caml-list@inria.fr>; Thu, 30 Jun 2011 04:30:49 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
        d=gmail.com; s=gamma;
        h=message-id:date:from:user-agent:mime-version:to:subject
         :content-type:content-transfer-encoding;
        bh=PKek/kP/jpmYvWImPzuLArLnpZCWjvrIcKPdKJml7iM=;
        b=xR7OUq1ySjV/QFKplD45pZxhmIyU5PA+iA3QRChVSNbE5kHBXxfiMzuTIp63yO/mA0
         DqL4IGlWMc+mIdTentOeWWn3OlgpSkKrrCh68+cFIi9cVWKbX9RBg7fSGqk2ylmA21dT
         J4OXA2QrZmKOiWHq5fKaAWltA4tGiyOL6HThw=
Received: by 10.227.209.131 with SMTP id gg3mr1744256wbb.79.1309433448964;
        Thu, 30 Jun 2011 04:30:48 -0700 (PDT)
Received: from [192.168.1.186] (106.165.7.93.rev.sfr.net [93.7.165.106])
        by mx.google.com with ESMTPS id ej7sm1558622wbb.53.2011.06.30.04.30.46
        (version=SSLv3 cipher=OTHER);
        Thu, 30 Jun 2011 04:30:47 -0700 (PDT)
Message-ID: <4E0C5E67.9010606@gmail.com>
Date: Thu, 30 Jun 2011 13:30:47 +0200
From: Andrew <newsgroups.fr@gmail.com>
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:5.0) Gecko/20110624 Thunderbird/5.0
MIME-Version: 1.0
To: caml-list@inria.fr
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Subject: [Caml-list] Priority queues

Hi there,

Does the standard library provide priority queues in OCaml? I'll be taking exams where I can use OCaml in a few days, 
but I couldn't find much documentation on priority queues online.

How would you implement Dijkstra's algorithm, otherwise?

Thanks!