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 PAA32399; Fri, 27 Feb 2004 15:49:06 +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 PAA03357 for ; Fri, 27 Feb 2004 15:49:05 +0100 (MET) Received: from lri.lri.fr (lri.lri.fr [129.175.15.1]) by concorde.inria.fr (8.12.10/8.12.10) with ESMTP id i1REn4ae026071 for ; Fri, 27 Feb 2004 15:49:04 +0100 Received: from pc8-123 (pc8-123 [129.175.8.123]) by lri.lri.fr (8.12.10/jtpda-5.4) with ESMTP id i1REb3UV022461 for ; Fri, 27 Feb 2004 15:37:03 +0100 (MET) Received: from filliatr by pc8-123 with local (Exim 3.35 #1 (Debian)) id 1Awj6t-000524-00 for ; Fri, 27 Feb 2004 15:37:03 +0100 From: Jean-Christophe Filliatre MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Message-ID: <16447.22031.171610.745763@gargle.gargle.HOWL> Date: Fri, 27 Feb 2004 15:37:03 +0100 To: caml-list@inria.fr Subject: [Caml-list] announce: ocamlgraph X-Mailer: VM 7.03 under Emacs 20.7.2 Reply-To: Jean-Christophe.Filliatre@lri.fr (Jean-Christophe Filliatre) X-MailScanner: Found to be clean X-Miltered: at concorde by Joe's j-chkmail ("http://j-chkmail.ensmp.fr")! X-Loop: caml-list@inria.fr X-Spam: no; 0.00; filliatre:01 filliatre:01 lri:01 scc:99 bfs:99 topological:01 transitive:01 functors:01 api:01 lri:01 filliatr:01 signoles:01 ocaml:01 ocaml:01 labelled:01 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk Dear ocaml users, It is our pleasure to announce the first release of ocamlgraph, a graph library for ocaml. ocamlgraph intends to provide - several graph data strucures (persistent or imperative, labelled or not, directed or not, etc.) - several graph algorithms (shortest path, maximal flow, SCC, DFS, BFS, topological order, etc.) and graph operations (transitive closure, mirror, complement, union, intersection, random graph, random planar graph, etc.) Algorithms and operations are written independently of the graph data structrure (as functors) and thus can be easily reused in other contexts. Distribution and full API at http://www.lri.fr/~filliatr/ocamlgraph/ Comments and contributions are welcome. -- Sylvain Conchon Jean-Christophe Filliātre Julien Signoles ------------------- 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