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 UAA07814; Wed, 26 Sep 2001 20:04:28 +0200 (MET DST) 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 UAA07818 for ; Wed, 26 Sep 2001 20:04:27 +0200 (MET DST) Received: from maile.telia.com (maile.telia.com [194.22.190.16]) by concorde.inria.fr (8.11.1/8.10.0) with ESMTP id f8QI4Qn05902 for ; Wed, 26 Sep 2001 20:04:26 +0200 (MET DST) Received: from d1o849.telia.com (d1o849.telia.com [213.66.248.241]) by maile.telia.com (8.11.6/8.11.6) with ESMTP id f8QI4Qd23607; Wed, 26 Sep 2001 20:04:26 +0200 (CEST) Received: from gateway (h40n2fls34o849.telia.com [217.208.235.40]) by d1o849.telia.com (8.10.2/8.10.1) with SMTP id f8QI4Pa12735; Wed, 26 Sep 2001 20:04:25 +0200 (CEST) From: "Mattias Waldau" To: "Brian Rogoff" , "Mattias Waldau" Cc: Subject: RE: [Caml-list] Looking for Graph Operations-library Date: Wed, 26 Sep 2001 20:04:27 +0200 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="US-ASCII" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2911.0) In-Reply-To: <20010926100035.L20515-100000@shell5.ba.best.com> X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2526.0000 Importance: Normal Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk I looked thru the documentation, but FGL doesn't seem to be any operations like closures and topological sorting in fgl, it mostly seems to be about traversing the structure. Have I missed something? When I look at one of the papers, you get the impression that an imperative implementation is one to two magnitudes faster, is that right? (Speed is irrelevant right now for me.) /mattias -----Original Message----- From: owner-caml-list@pauillac.inria.fr [mailto:owner-caml-list@pauillac.inria.fr]On Behalf Of Brian Rogoff Sent: Wednesday, September 26, 2001 7:14 PM To: Mattias Waldau Cc: caml-list@inria.fr Subject: Re: [Caml-list] Looking for Graph Operations-library On Wed, 26 Sep 2001, Mattias Waldau wrote: > I am converting some code from SICStus Prolog, and need a directed graph > library for Ocaml. Any pointers? I ported part of Martin Erwig's Functional Graph Library to OCaml, the part that uses functional maps as arrays. I used a hacked version of Jean-Christophe Filliatre's Patricia tree implementation for that. I haven't yet written the version tree code. If you don't mind its incomplete state and would like to help complete the port I can wrap it up and e-mail it to you. See http://www.cs.orst.edu/~erwig/fgl/ for the original. You might also consider porting a more imperative library, like the one in SML for MLRISC, if you are comfortable with SML too. FGL is cool but I'm not confident that the performance will match a tuned imperative implementation :-). -- Brian ------------------- Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ 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/ To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr