From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id PAA03417; Thu, 29 Jan 2004 15:11:03 +0100 (MET) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id PAA03671 for ; Thu, 29 Jan 2004 15:11:02 +0100 (MET) Received: from cgpsrv2.cis.mcmaster.ca (cgpsrv2.CIS.mcmaster.ca [130.113.64.62]) by concorde.inria.fr (8.11.1/8.11.1) with ESMTP id i0TEB0P20903 for ; Thu, 29 Jan 2004 15:11:00 +0100 (MET) Received: from [65.48.130.10] (account ) by cgpsrv2.cis.mcmaster.ca (CommuniGate Pro WebUser 4.0.6) with HTTP id 11097740; Thu, 29 Jan 2004 09:10:56 -0500 From: "Jacques Carette" Subject: Re: [Caml-list] poll for a graph library To: Jean-Christophe.Filliatre@lri.fr (Jean-Christophe Filliatre), Thomas Fischbacher Cc: signoles@pc8-123.lri.fr, conchon@pc8-123.lri.fr, caml-list@inria.fr X-Mailer: CommuniGate Pro Web Mailer v.4.0.6 Date: Thu, 29 Jan 2004 09:10:56 -0500 Message-ID: In-Reply-To: <16409.2937.135897.374276@gargle.gargle.HOWL> MIME-Version: 1.0 Content-Type: text/plain; charset="ISO-8859-1"; format="flowed" Content-Transfer-Encoding: 8bit X-Loop: caml-list@inria.fr X-Spam: no; 0.00; jacques:01 caml-list:01 filliatre:01 filliatre:01 lri:01 functors:01 figuring:01 functor:01 jacques:01 inefficient:01 feasible:01 behaviour:01 modules:02 wrote:03 algorithm:03 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Jean-Christophe Filliatre wrote: > 2. Several algorithms over graphs, written as functors and thus > independently of the graph implementation Sounds very useful. One item I would very much like to see: when one is merely interested in using some (efficient!) graph algorithm, there is often a choice of data structures to be made. Figuring out the asymptotics of each algorithm over each data structure is feasible, but should be quite unnecessary: it would be quite convenient if there were information functions [as part of the functor modules] which would output the asymptotic behaviour of the instantiations. This would be especially useful as some data structure-algorithm pairs are woefully inefficient, especially when it comes to graphs! Jacques ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners