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