Name                    Last modified       Size  Description

 Parent Directory        05-Apr-2006 11:45      -  
 CHANGES                 27-Sep-2006 09:53     5k  
 COPYING                 27-Sep-2006 09:53     1k  
 CREDITS                 27-Sep-2006 09:53     1k  
 FAQ                     27-Sep-2006 09:53     2k  
 LGPL                    27-Sep-2006 09:53    25k  
 color.ml                27-Sep-2006 09:53     6k  
 demo.ml                 27-Sep-2006 09:53     1k  
 demo_planar.ml          27-Sep-2006 09:53     8k  
 ocamlgraph-0.5.tar.gz   05-Feb-2004 11:26    59k  
 ocamlgraph-0.6.tar.gz   18-Feb-2004 15:28    68k  
 ocamlgraph-0.61.tar.gz  20-Feb-2004 15:43    73k  
 ocamlgraph-0.70.tar.gz  27-Feb-2004 15:24    85k  
 ocamlgraph-0.80.tar.gz  28-Jun-2004 09:34    95k  
 ocamlgraph-0.81.tar.gz  13-Jul-2004 15:55    95k  
 ocamlgraph-0.90.tar.gz  30-Nov-2004 16:32    84k  
 ocamlgraph-0.91.tar.gz  16-Dec-2004 22:42    85k  
 ocamlgraph-0.92.tar.gz  18-Jan-2005 10:18    87k  
 ocamlgraph-0.93.tar.gz  31-Mar-2005 15:34    88k  
 ocamlgraph-0.94.tar.gz  06-Jul-2005 15:21    93k  
 ocamlgraph-0.94a.tar.gz 19-Jul-2005 10:02    94k  
 ocamlgraph-0.95.tar.gz  02-Nov-2005 14:43    93k  
 ocamlgraph-0.96.tar.gz  02-May-2006 10:10    98k  
 ocamlgraph-0.97.tar.gz  20-Jul-2006 09:30   110k  
 ocamlgraph-0.98.tar.gz  27-Sep-2006 09:53   107k  
 sudoku.ml               27-Sep-2006 09:53     2k  

Ocamlgraph is a graph library for Ocaml. Its contribution is three-fold:

1. It provides an easy-to-use graph implementation together with several
   operations and algorithms over graphs, in Graph.Pack.Digraph.
   It is a reasonably efficient imperative data structure for directed graphs 
   with vertices and edges labeled with integers.

   Have a look at this module first in order to get an overview of what
   this library provides. See also `demo.ml'.

2. Then ocamlgraph provides several other graph implementations for those
   not satisfied with the one above. Some are persistent (imutable) and other
   imperative (mutable). Some are directed and other are not.
   Some have labels for vertices, or labels for edges, or both. 
   Some have abstract types for vertices. etc.
 
   See interface Sig for the graph signatures and modules Persistent and 
   Imperative for the implementations.

   These implementations are written as functors: you give the types of 
   vertices labels, edge labels, etc. and you get the data structure as a
   result.

3. Finally, ocamlgraph provides several classic operations and algorithms
   over graphs. They are also written as functors i.e. independently of the 
   data structure for graphs. One consequence is that you can define your own
   data structure for graphs and yet re-use all the algorithms from this 
   library -- you only need to provide a few operations such as iterating over
   all vertices, over the successors of a vertex, etc.


How to link with ocamlgraph
---------------------------

ocamlgraph is packaged as a single module `Graph'. Link is done as follows:

- bytecode

	ocamlc graph.cma <other files>

- native code

	ocamlopt graph.cmxa <other files>


Examples
--------

You'll find examples of ocamlgraph use in demo.ml, demo_planar.ml and color.ml 
(you can compile these programs with "make demo.opt", "make demo_planar.opt"
and "make color.opt" respectively).