From: Jean-Christophe Filliatre <Jean-Christophe.Filliatre@lri.fr>
To: Thomas Fischbacher <Thomas.Fischbacher@Physik.Uni-Muenchen.DE>
Cc: signoles@pc8-123.lri.fr, conchon@pc8-123.lri.fr, caml-list@inria.fr
Subject: Re: [Caml-list] poll for a graph library
Date: Thu, 29 Jan 2004 14:32:41 +0100 [thread overview]
Message-ID: <16409.2937.135897.374276@gargle.gargle.HOWL> (raw)
In-Reply-To: <Pine.LNX.4.58.0401291409180.3416@seekar.cip.physik.uni-muenchen.de>
Thomas Fischbacher writes:
>
> What do you mean by "graph library"?
>
> A library of graph algorithms (highly desirable - right now I am working
> at a problem where efficient generation of planar graphs is THE main
> issue, and I do it in lisp/ocaml), a graph layout library in the sense
> of a re-implementation of graphviz in ocaml (would also be very nice to
> have), or a plotting library in the sense of gnuplot?
>
> I think you should clarify this a bit more on the list...
You're right, I should have been clearer. We didn't want to give too
many details before the first release, but let's go. Our library is
currently providing
1. Several data structures for graphs (persistent or imperative,
directed or not, with labeled edges or not, etc.), sharing a
common minimal signature (iterators over vertices, edges, etc.)
2. Several algorithms over graphs, written as functors and thus
independently of the graph implementation (it means you can build
your own data structure for graphs and still re-use the algorithms
code). Currently we have the following algorithms coded: Tarjan's
strongly connected components, Dijkstra's shortest path,
Ford-Fulkerson's maximal flow, Warshall's transitive closure, DFS
and BFS traversal, cycle detection.
We are currently adding random graph generations based on
algorithms from Knuth's Stanford GraphBase, including the
generation of random planar graphs. (This at least seems to be in
connection with what you're doing.)
3. Utilities, such as a graphviz output --- an ascii output in the
DOT format to be precise (So we are not re-implementing a graph
layout library).
--
Jean-Christophe Filliâtre
-------------------
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
next prev parent reply other threads:[~2004-01-29 13:33 UTC|newest]
Thread overview: 10+ messages / expand[flat|nested] mbox.gz Atom feed top
2004-01-29 12:34 Jean-Christophe Filliatre
[not found] ` <Pine.LNX.4.58.0401291409180.3416@seekar.cip.physik.uni-muenchen.de>
2004-01-29 13:32 ` Jean-Christophe Filliatre [this message]
2004-01-29 14:10 ` Jacques Carette
2004-01-29 14:31 ` Andrew Bagdanov
2004-01-31 13:40 ` Eray Ozkural
2004-01-29 14:54 ` Plotting library (was: Re: [Caml-list] poll for a graph library) Richard Jones
2004-01-29 17:21 ` [Caml-list] poll for a graph library Jocelyn Sérot
2004-01-29 22:19 ` David MENTRE
2004-01-30 18:24 ` brogoff
2004-01-30 9:40 ` fva
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=16409.2937.135897.374276@gargle.gargle.HOWL \
--to=jean-christophe.filliatre@lri.fr \
--cc=Thomas.Fischbacher@Physik.Uni-Muenchen.DE \
--cc=caml-list@inria.fr \
--cc=conchon@pc8-123.lri.fr \
--cc=signoles@pc8-123.lri.fr \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox