C[omp]ute

From: "andrew cooke" <andrew@...>

Date: Fri, 27 Feb 2004 17:16:42 -0300 (CLST)

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.

http://www.lri.fr/~filliatr/ocamlgraph/

(Good example of functors, also shows some functor related restrictions
(see FAQ) - much nicer than my clunky Voronoi triangulation code in ML!)

From OCaml-list

Andrew

-- 
  __ _ __ ___  ___| |_____   work web site: http://www.ctio.noao.edu/~andrew
 / _` / _/ _ \/ _ \ / / -_)  personal web site: http://www.acooke.org
 \__,_\__\___/\___/_\_\___|  personal gallery: http://www.acooke.org/pancito


_______________________________________________
compute mailing list
compute@...
https://200.83.153.5/cgi-bin/mailman/listinfo/compute