* [Caml-list] announce: ocamlgraph
@ 2004-02-27 14:37 Jean-Christophe Filliatre
0 siblings, 0 replies; only message in thread
From: Jean-Christophe Filliatre @ 2004-02-27 14:37 UTC (permalink / raw)
To: caml-list
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2004-02-27 14:49 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-02-27 14:37 [Caml-list] announce: ocamlgraph Jean-Christophe Filliatre
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).