[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#233764: ITP: ocamlgraph -- A graph library for OCaml

Package: wnpp
Severity: wishlist

* Package name    : ocamlgraph
  Version         : 0.6
  Upstream Author : S. Conchon, J.C. Filliâtre, F. Pottier, J. Signoles, V. Simonet, M. Sozeau 
* URL             : http://www.lri.fr/~filliatr/ocamlgraph/
* License         : LGPL
  Description     : A graph library for OCaml

Ocamlgraph is a graph library for OCaml. Provides the following 
contribution :
 - An easy-to-use graph data structure together with
   several operations and algorithms over graphs. It also
   provides more complex graph structures ( persistent, imperative,
   with label for vertices, with label for edges... )

 - Several classic operations and algorithms over
   graphs. ( Graph traversal, Strongly connected components,
   Ford-Fulkerson maximal flow algorithm, Delaunay triangulation,
   Kruskal's algorithm, Goldberg maximal flow algorithm, mirror, 
   complement, transitive_closure ).
Each algorithm is made over functor, those allowing to create your
own graph, by only providing a small set of functionnality.

Sylvain LE GALL

-- System Information:
Debian Release: testing/unstable
  APT prefers unstable
  APT policy: (500, 'unstable')
Architecture: i386 (i686)
Kernel: Linux 2.6.1
Locale: LANG=fr_FR@euro, LC_CTYPE=fr_FR@euro

Reply to: