Commits

camlspotter  committed 38e1e74

ocamlgraph oasis 1.7

  • Participants
  • Parent commits 3251726

Comments (0)

Files changed (155)

File ocamlgraph/OMakefile

-URL=http://ocamlgraph.lri.fr/download/ocamlgraph-1.7.tar.gz
-EXTRACT_DIR=ocamlgraph-1.7
-REQUIRED_PACKS=
-INSTALL=(cd $(EXTRACT_DIR); ./configure; make all install install-findlib)
-OCamlExternalPack(ocamlgraph)
+OMyOasisDir(ocamlgraph, ocamlgraph-1.7, $(EMPTY))

File ocamlgraph/ocamlgraph-1.7-oasis3.tar.gz

Binary file added.

File ocamlgraph/ocamlgraph-1.7/.depend

+lib/bitv.cmo: lib/bitv.cmi 
+lib/bitv.cmx: lib/bitv.cmi 
+lib/heap.cmo: lib/heap.cmi 
+lib/heap.cmx: lib/heap.cmi 
+lib/unionfind.cmo: lib/unionfind.cmi 
+lib/unionfind.cmx: lib/unionfind.cmi 
+lib/bitv.cmi: 
+lib/heap.cmi: 
+lib/unionfind.cmi: 
+src/blocks.cmo: src/util.cmi src/sig.cmi 
+src/blocks.cmx: src/util.cmx src/sig.cmi 
+src/builder.cmo: src/sig.cmi src/builder.cmi 
+src/builder.cmx: src/sig.cmi src/builder.cmi 
+src/classic.cmo: src/sig.cmi src/builder.cmi src/classic.cmi 
+src/classic.cmx: src/sig.cmi src/builder.cmx src/classic.cmi 
+src/cliquetree.cmo: src/util.cmi src/sig.cmi src/persistent.cmi src/oper.cmi \
+    src/gmap.cmi src/builder.cmi src/cliquetree.cmi 
+src/cliquetree.cmx: src/util.cmx src/sig.cmi src/persistent.cmx src/oper.cmx \
+    src/gmap.cmx src/builder.cmx src/cliquetree.cmi 
+src/coloring.cmo: src/traverse.cmi src/sig.cmi src/coloring.cmi 
+src/coloring.cmx: src/traverse.cmx src/sig.cmi src/coloring.cmi 
+src/components.cmo: src/util.cmi src/sig.cmi src/components.cmi 
+src/components.cmx: src/util.cmx src/sig.cmi src/components.cmi 
+src/delaunay.cmo: src/delaunay.cmi 
+src/delaunay.cmx: src/delaunay.cmi 
+src/dot.cmo: src/dot_parser.cmi src/dot_lexer.cmo src/dot_ast.cmi \
+    src/builder.cmi src/dot.cmi 
+src/dot.cmx: src/dot_parser.cmx src/dot_lexer.cmx src/dot_ast.cmi \
+    src/builder.cmx src/dot.cmi 
+src/dot_lexer.cmo: src/dot_parser.cmi src/dot_ast.cmi 
+src/dot_lexer.cmx: src/dot_parser.cmx src/dot_ast.cmi 
+src/dot_parser.cmo: src/dot_ast.cmi src/dot_parser.cmi 
+src/dot_parser.cmx: src/dot_ast.cmi src/dot_parser.cmi 
+src/flow.cmo: src/util.cmi src/sig.cmi src/flow.cmi 
+src/flow.cmx: src/util.cmx src/sig.cmi src/flow.cmi 
+src/gmap.cmo: src/sig.cmi src/gmap.cmi 
+src/gmap.cmx: src/sig.cmi src/gmap.cmi 
+src/gml.cmo: src/builder.cmi src/gml.cmi 
+src/gml.cmx: src/builder.cmx src/gml.cmi 
+src/graphviz.cmo: src/sig.cmi src/graphviz.cmi 
+src/graphviz.cmx: src/sig.cmi src/graphviz.cmi 
+src/imperative.cmo: src/sig.cmi src/blocks.cmo lib/bitv.cmi \
+    src/imperative.cmi 
+src/imperative.cmx: src/sig.cmi src/blocks.cmx lib/bitv.cmx \
+    src/imperative.cmi 
+src/kruskal.cmo: src/util.cmi lib/unionfind.cmi src/sig.cmi src/kruskal.cmi 
+src/kruskal.cmx: src/util.cmx lib/unionfind.cmx src/sig.cmi src/kruskal.cmi 
+src/mcs_m.cmo: src/util.cmi src/sig.cmi src/persistent.cmi src/oper.cmi \
+    src/imperative.cmi src/gmap.cmi src/builder.cmi src/mcs_m.cmi 
+src/mcs_m.cmx: src/util.cmx src/sig.cmi src/persistent.cmx src/oper.cmx \
+    src/imperative.cmx src/gmap.cmx src/builder.cmx src/mcs_m.cmi 
+src/md.cmo: src/sig.cmi src/oper.cmi src/gmap.cmi src/cliquetree.cmi \
+    src/builder.cmi src/md.cmi 
+src/md.cmx: src/sig.cmi src/oper.cmx src/gmap.cmx src/cliquetree.cmx \
+    src/builder.cmx src/md.cmi 
+src/minsep.cmo: src/sig.cmi src/oper.cmi src/components.cmi src/minsep.cmi 
+src/minsep.cmx: src/sig.cmi src/oper.cmx src/components.cmx src/minsep.cmi 
+src/oper.cmo: src/sig.cmi src/builder.cmi src/oper.cmi 
+src/oper.cmx: src/sig.cmi src/builder.cmx src/oper.cmi 
+src/pack.cmo: src/traverse.cmi src/topological.cmi src/sig.cmi src/rand.cmi \
+    src/path.cmi src/oper.cmi src/kruskal.cmi src/imperative.cmi \
+    src/graphviz.cmi src/gml.cmi src/flow.cmi src/dot.cmi src/components.cmi \
+    src/classic.cmi src/builder.cmi src/pack.cmi 
+src/pack.cmx: src/traverse.cmx src/topological.cmx src/sig.cmi src/rand.cmx \
+    src/path.cmx src/oper.cmx src/kruskal.cmx src/imperative.cmx \
+    src/graphviz.cmx src/gml.cmx src/flow.cmx src/dot.cmx src/components.cmx \
+    src/classic.cmx src/builder.cmx src/pack.cmi 
+src/path.cmo: src/util.cmi src/sig.cmi lib/heap.cmi src/path.cmi 
+src/path.cmx: src/util.cmx src/sig.cmi lib/heap.cmx src/path.cmi 
+src/persistent.cmo: src/util.cmi src/sig.cmi src/blocks.cmo \
+    src/persistent.cmi 
+src/persistent.cmx: src/util.cmx src/sig.cmi src/blocks.cmx \
+    src/persistent.cmi 
+src/rand.cmo: src/sig.cmi src/delaunay.cmi src/builder.cmi src/rand.cmi 
+src/rand.cmx: src/sig.cmi src/delaunay.cmx src/builder.cmx src/rand.cmi 
+src/strat.cmo: src/sig.cmi src/strat.cmi 
+src/strat.cmx: src/sig.cmi src/strat.cmi 
+src/topological.cmo: src/sig.cmi src/topological.cmi 
+src/topological.cmx: src/sig.cmi src/topological.cmi 
+src/traverse.cmo: src/sig.cmi src/traverse.cmi 
+src/traverse.cmx: src/sig.cmi src/traverse.cmi 
+src/util.cmo: src/sig.cmi src/util.cmi 
+src/util.cmx: src/sig.cmi src/util.cmi 
+src/version.cmo: 
+src/version.cmx: 
+src/builder.cmi: src/sig.cmi 
+src/classic.cmi: src/sig.cmi 
+src/cliquetree.cmi: src/sig.cmi 
+src/coloring.cmi: src/sig.cmi 
+src/components.cmi: src/util.cmi src/sig.cmi 
+src/delaunay.cmi: 
+src/dot.cmi: src/dot_ast.cmi src/builder.cmi 
+src/dot_ast.cmi: 
+src/dot_parser.cmi: src/dot_ast.cmi 
+src/flow.cmi: src/sig.cmi 
+src/gmap.cmi: src/sig.cmi 
+src/gml.cmi: src/builder.cmi 
+src/graphviz.cmi: src/sig.cmi 
+src/imperative.cmi: src/sig.cmi 
+src/kruskal.cmi: src/sig.cmi 
+src/mcs_m.cmi: src/sig.cmi 
+src/md.cmi: src/sig.cmi 
+src/minsep.cmi: src/sig.cmi 
+src/oper.cmi: src/sig.cmi src/builder.cmi 
+src/pack.cmi: src/sig_pack.cmi 
+src/path.cmi: src/sig.cmi 
+src/persistent.cmi: src/sig.cmi 
+src/rand.cmi: src/sig.cmi src/builder.cmi 
+src/sig.cmi: 
+src/sig_pack.cmi: 
+src/strat.cmi: src/sig.cmi 
+src/topological.cmi: src/sig.cmi 
+src/traverse.cmi: src/sig.cmi 
+src/util.cmi: src/sig.cmi 
+editor/dirTree.cmi: 
+editor/gtree.cmi: 
+editor/htree.cmi: 
+editor/dirTree.cmo: editor/dirTree.cmi 
+editor/dirTree.cmx: editor/dirTree.cmi 
+editor/ed_display.cmo: editor/ed_hyper.cmo editor/ed_graph.cmo 
+editor/ed_display.cmx: editor/ed_hyper.cmx editor/ed_graph.cmx 
+editor/ed_draw.cmo: editor/ed_hyper.cmo editor/ed_graph.cmo \
+    src/components.cmi 
+editor/ed_draw.cmx: editor/ed_hyper.cmx editor/ed_graph.cmx \
+    src/components.cmx 
+editor/ed_graph.cmo: src/traverse.cmi src/imperative.cmi src/graphviz.cmi \
+    src/gml.cmi editor/ed_hyper.cmo src/dot_ast.cmi src/dot.cmi \
+    src/components.cmi src/builder.cmi 
+editor/ed_graph.cmx: src/traverse.cmx src/imperative.cmx src/graphviz.cmx \
+    src/gml.cmx editor/ed_hyper.cmx src/dot_ast.cmi src/dot.cmx \
+    src/components.cmx src/builder.cmx 
+editor/ed_hyper.cmo: 
+editor/ed_hyper.cmx: 
+editor/ed_main.cmo: editor/ed_hyper.cmo editor/ed_graph.cmo \
+    editor/ed_draw.cmo editor/ed_display.cmo 
+editor/ed_main.cmx: editor/ed_hyper.cmx editor/ed_graph.cmx \
+    editor/ed_draw.cmx editor/ed_display.cmx 
+editor/editor.cmo: editor/gtree.cmi 
+editor/editor.cmx: editor/gtree.cmx 
+editor/gen.cmo: src/classic.cmi 
+editor/gen.cmx: src/classic.cmx 
+editor/graphEd.cmo: editor/outils_tort.cmo editor/outils_math.cmo \
+    src/components.cmi 
+editor/graphEd.cmx: editor/outils_tort.cmx editor/outils_math.cmx \
+    src/components.cmx 
+editor/graphEdGTK.cmo: src/traverse.cmi editor/outils_tort.cmo \
+    editor/outils_math.cmo src/imperative.cmi src/gml.cmi src/dot_ast.cmi \
+    src/dot.cmi src/components.cmi src/builder.cmi 
+editor/graphEdGTK.cmx: src/traverse.cmx editor/outils_tort.cmx \
+    editor/outils_math.cmx src/imperative.cmx src/gml.cmx src/dot_ast.cmi \
+    src/dot.cmx src/components.cmx src/builder.cmx 
+editor/gtree.cmo: editor/htree.cmi src/components.cmi editor/gtree.cmi 
+editor/gtree.cmx: editor/htree.cmx src/components.cmx editor/gtree.cmi 
+editor/htree.cmo: editor/htree.cmi 
+editor/htree.cmx: editor/htree.cmi 
+editor/outils_math.cmo: 
+editor/outils_math.cmx: 
+editor/outils_tort.cmo: editor/outils_math.cmo 
+editor/outils_tort.cmx: editor/outils_math.cmx 
+view_graph/viewGraph_core.cmi: 
+view_graph/viewGraph_select.cmi: view_graph/viewGraph_core.cmi 
+view_graph/viewGraph_utils.cmi: view_graph/viewGraph_select.cmi 
+view_graph/viewGraph_core.cmo: src/imperative.cmi src/dot_ast.cmi src/dot.cmi \
+    src/builder.cmi view_graph/viewGraph_core.cmi 
+view_graph/viewGraph_core.cmx: src/imperative.cmx src/dot_ast.cmi src/dot.cmx \
+    src/builder.cmx view_graph/viewGraph_core.cmi 
+view_graph/viewGraph_select.cmo: view_graph/viewGraph_core.cmi \
+    view_graph/viewGraph_select.cmi 
+view_graph/viewGraph_select.cmx: view_graph/viewGraph_core.cmx \
+    view_graph/viewGraph_select.cmi 
+view_graph/viewGraph_test.cmo: view_graph/viewGraph_utils.cmi \
+    view_graph/viewGraph_select.cmi 
+view_graph/viewGraph_test.cmx: view_graph/viewGraph_utils.cmx \
+    view_graph/viewGraph_select.cmx 
+view_graph/viewGraph_utils.cmo: view_graph/viewGraph_select.cmi \
+    view_graph/viewGraph_utils.cmi 
+view_graph/viewGraph_utils.cmx: view_graph/viewGraph_select.cmx \
+    view_graph/viewGraph_utils.cmi 
+dgraph/dGraphContainer.cmi: src/sig.cmi src/graphviz.cmi \
+    dgraph/dGraphView.cmi dgraph/dGraphModel.cmi 
+dgraph/dGraphModel.cmi: dgraph/xDot.cmi src/sig.cmi 
+dgraph/dGraphRandModel.cmi: dgraph/dGraphModel.cmi 
+dgraph/dGraphSubTree.cmi: src/sig.cmi dgraph/dGraphModel.cmi 
+dgraph/dGraphTreeLayout.cmi: dgraph/xDot.cmi src/sig.cmi src/graphviz.cmi \
+    dgraph/dGraphModel.cmi 
+dgraph/dGraphTreeModel.cmi: dgraph/xDot.cmi dgraph/dGraphModel.cmi 
+dgraph/dGraphView.cmi: src/sig.cmi dgraph/dGraphViewItem.cmi \
+    dgraph/dGraphModel.cmi 
+dgraph/dGraphViewItem.cmi: dgraph/xDotDraw.cmi dgraph/xDot.cmi 
+dgraph/xDot.cmi: dgraph/xDotDraw.cmi src/dot_ast.cmi 
+dgraph/xDotDraw.cmi: 
+dgraph/dGraphContainer.cmo: src/sig.cmi src/graphviz.cmi \
+    dgraph/dGraphView.cmi dgraph/dGraphTreeModel.cmi dgraph/dGraphModel.cmi \
+    dgraph/dGraphContainer.cmi 
+dgraph/dGraphContainer.cmx: src/sig.cmi src/graphviz.cmx \
+    dgraph/dGraphView.cmx dgraph/dGraphTreeModel.cmx dgraph/dGraphModel.cmx \
+    dgraph/dGraphContainer.cmi 
+dgraph/dGraphMake.cmo: dgraph/xDot.cmi 
+dgraph/dGraphMake.cmx: dgraph/xDot.cmx 
+dgraph/dGraphModel.cmo: dgraph/xDot.cmi src/imperative.cmi src/graphviz.cmi \
+    src/dot.cmi src/builder.cmi dgraph/dGraphModel.cmi 
+dgraph/dGraphModel.cmx: dgraph/xDot.cmx src/imperative.cmx src/graphviz.cmx \
+    src/dot.cmx src/builder.cmx dgraph/dGraphModel.cmi 
+dgraph/dGraphRandModel.cmo: src/rand.cmi src/imperative.cmi \
+    dgraph/dGraphView.cmi dgraph/dGraphModel.cmi dgraph/dGraphRandModel.cmi 
+dgraph/dGraphRandModel.cmx: src/rand.cmx src/imperative.cmx \
+    dgraph/dGraphView.cmx dgraph/dGraphModel.cmx dgraph/dGraphRandModel.cmi 
+dgraph/dGraphSubTree.cmo: src/sig.cmi dgraph/dGraphModel.cmi \
+    dgraph/dGraphSubTree.cmi 
+dgraph/dGraphSubTree.cmx: src/sig.cmi dgraph/dGraphModel.cmx \
+    dgraph/dGraphSubTree.cmi 
+dgraph/dGraphTreeLayout.cmo: dgraph/xDotDraw.cmi dgraph/xDot.cmi src/sig.cmi \
+    src/graphviz.cmi dgraph/dGraphModel.cmi dgraph/dGraphTreeLayout.cmi 
+dgraph/dGraphTreeLayout.cmx: dgraph/xDotDraw.cmx dgraph/xDot.cmx src/sig.cmi \
+    src/graphviz.cmx dgraph/dGraphModel.cmx dgraph/dGraphTreeLayout.cmi 
+dgraph/dGraphTreeModel.cmo: dgraph/xDot.cmi src/sig.cmi src/imperative.cmi \
+    src/graphviz.cmi dgraph/dGraphTreeLayout.cmi dgraph/dGraphSubTree.cmi \
+    dgraph/dGraphModel.cmi dgraph/dGraphTreeModel.cmi 
+dgraph/dGraphTreeModel.cmx: dgraph/xDot.cmx src/sig.cmi src/imperative.cmx \
+    src/graphviz.cmx dgraph/dGraphTreeLayout.cmx dgraph/dGraphSubTree.cmx \
+    dgraph/dGraphModel.cmx dgraph/dGraphTreeModel.cmi 
+dgraph/dGraphView.cmo: src/sig.cmi dgraph/dGraphViewItem.cmi \
+    dgraph/dGraphModel.cmi dgraph/dGraphView.cmi 
+dgraph/dGraphView.cmx: src/sig.cmi dgraph/dGraphViewItem.cmx \
+    dgraph/dGraphModel.cmx dgraph/dGraphView.cmi 
+dgraph/dGraphViewItem.cmo: dgraph/xDotDraw.cmi dgraph/xDot.cmi \
+    dgraph/dGraphModel.cmi dgraph/dGraphViewItem.cmi 
+dgraph/dGraphViewItem.cmx: dgraph/xDotDraw.cmx dgraph/xDot.cmx \
+    dgraph/dGraphModel.cmx dgraph/dGraphViewItem.cmi 
+dgraph/dGraphViewer.cmo: dgraph/dGraphContainer.cmi 
+dgraph/dGraphViewer.cmx: dgraph/dGraphContainer.cmx 
+dgraph/xDot.cmo: dgraph/xDotDraw.cmi src/util.cmi src/dot_ast.cmi src/dot.cmi \
+    dgraph/xDot.cmi 
+dgraph/xDot.cmx: dgraph/xDotDraw.cmx src/util.cmx src/dot_ast.cmi src/dot.cmx \
+    dgraph/xDot.cmi 
+dgraph/xDotDraw.cmo: dgraph/xDotDraw.cmi 
+dgraph/xDotDraw.cmx: dgraph/xDotDraw.cmi 

File ocamlgraph/ocamlgraph-1.7/CHANGES

+
+version 1.7, February 23, 2011
+------------------------------
+ o Makefile: fixed bug when installing ocamlgraph with ocamlfind
+ o DGraph: fixed bug with colors on some windows manager
+ o Configure: fixed issue with automatic detection of extension under
+   Windows/Mingw
+
+version 1.6, December 13, 2010
+------------------------------
+ o DGraph: new viewer mode (called `tree') which focus on a subset part of the
+   graph centered on a given node
+ o Graphviz: fixed bug with attribute `Constraint (was `Constraints) (patch by
+   Boris Yakobowski)
+ o DGraph: fixed font size issue when zooming
+ o DGraph: now interpret text anchors and espaced sequences correctly
+ o DGraph: offer possibility to disable the default callbacks on nodes
+ o 'make -j' works again
+ o new implementation Persistent.Digraph.ConcreteBidirectionalLabeled
+ o new implementation Persistent.Digraph.ConcreteBidirectional
+ o Makefile: bug fixed when ocamlc (resp. ocamlopt) and ocamlc.opt
+   (resp. ocamlopt.opt) are unconsistent
+
+version 1.5, April 29, 2010
+---------------------------
+ o Makefile: bug fixed when installing ocamlgraph with ocamlfind
+   (patch by Virgile Prevosto)
+ o DGraph: new method set_zoom_padding in DgraphView.view
+ o Traverse.Dfs.has_cycle: can now be used on undirected graphs as well,
+   and is now tail recursive
+ o DGraph: handle dotted ellipse
+
+version 1.4, March 24, 2010
+---------------------------
+ o new function [clear] for imperative graphs
+ o new implementation Imperative.Digraph.ConcreteBidirectionalLabeled
+   (contribution of Jaap Boender)
+ o Dgraph displays graphs faster
+ o DGraph: several bugs fixed
+ o DGraph: several API changes
+   (may break compatibility with existing development)
+
+version 1.3, October 2, 2009
+----------------------------
+ o Oper.mirror: undirected graphs are not copied anymore
+ o Oper.mirror: fixed bug (isolated vertices were lost)
+ o Graphviz: new signature GraphWithDotAttrs
+ o Improvements of Dgraph
+ o Configure: better test for detecting lablgtk
+ o OcamlGraph is now installed by default in `ocamlc -where`/ocamlgraph
+ o Viewgraph is now packed in a single module Viewgraph (break compatibility
+   with previous version)
+ o Dgraph is now packed in a single module Dgraph (break compatibility with
+   previous version)
+ o Makefile: fixed bug when the installation directory of binaries does not
+             exist
+ o Makefile: fixed bug of ocamldep under Windows
+
+version 1.2, August 31, 2009
+----------------------------
+ o experimental: new GTK-based graph viewer called Dgraph
+   (viewGraph is now deprecated)
+ o added Delaunay.iter_triangles (not of use in Ocamlgraph, actually)
+
+version 1.1, June 23, 2009
+--------------------------
+ o added constraint "type E.label = unit" to unlabeled graph data structure
+ o viewGraph: new module viewGraph_utils; fixed compilation (gtkInit
+   was missing; patch by Mehdi Dogguy)
+ o configure: fixed bug under Cygwin (patch by Julien Bernet)
+ o configure: look for lablgnomecanvas.cmxa when compiling in native code
+ o Makefile: fixed make install-findlib when lablgtk and/or
+   lablgnomecanvas not installed (patch by Peter Hawkins)
+
+version 1.0, October 14, 2008
+-----------------------------
+ o license: LGPL updated to version 2.1
+ o ocamlgraph now requires ocaml 3.10 or higher
+ o experimental: GTK-based graph viewer based on dot
+   (contribution of Anne Pacalet)
+ o Makefile:
+     - fixed bug when lablgnomecanvas is not installed
+     - fixed bug when ocamlfind is installed
+     - patch to the build system for a DESTDIR (patch by Igor Galic)
+     - "make -j" compliant
+ o new function Blocks.after_unserialization in order to be able to safely
+   serialize abstract vertices (see the FAQ)
+ o Dot:
+     - fixed bug in the parsing of attributes
+     - fixed bug in the parsing of subgraphs (patch by Anne Pacalet)
+ o Oper: fixed bug in intersect
+ o Path: improved efficiency of Dijkstra
+ o Topological:
+     - fixed bug in Make.{iter,fold}
+     - folding is now tail-recursive (patch by Michael Furr)
+
+version 0.99c, April 3rd, 2008
+------------------------------
+ o replicated a bug fix of Bitv (could not affect Matrix, though)
+ o fixed DFS traversal in Traverse.Dfs.{prefix,prefix_component,iterator}
+
+version 0.99b, December 18th, 2007
+----------------------------------
+ o fixed link bug with ocaml 3.09
+   (see http://caml.inria.fr/mantis/view.php?id=4124)
+
+version 0.99a, November 21st, 2007
+---------------------------------
+ o fixed bug in Makefile when lablgtk2 is not installed
+ o Sig.I.create and Sig_pack.create are now of type ?size:int -> unit -> t
+   (instead of unit -> t) to indicate an initial guess on the graph size
+
+version 0.99, June 27th, 2007
+-----------------------------
+ o experimental: GTK-based graph editor based on hyperbolic geometry;
+   to build it and test it, cd to editor/ and type make
+ o [Components.Make] functor: function [scc] as a new profile and a
+   more precise specification. New function [scc_array].
+ o fixed configure to set ocaml's standard library using "ocamlc -where"
+ o new module Dot to parse files in Graphviz's DOT format
+ o slight change in the license (no more clause 6 of the LGPL; see LICENSE)
+ o new module Strat implementing simple game strategies
+ o Graphviz: little refactoring and improved documentation
+
+version 0.98, Sep 27th, 2006
+----------------------------
+ o rename Sig.IA to Sig.IM
+ o add subgraph support in Graphviz
+   (breaks ascendent compatibility if you use Graphviz: by default add
+      let get_subgraph _ = None
+   in the argument of Graphviz.Dot and Graphviz.Neato)
+
+version 0.97, July 20th, 2006
+-----------------------------
+ o fixed compilation under Windows/Cygwin (contributed by Denis Berthod)
+ o fixed bug with escaped string in Graphviz
+
+version 0.96, May 2nd, 2006
+---------------------------
+ o new demo program: sudoku.ml (solving the Sudoku using graph coloring)
+ o new module Coloring for (rather brute force) graph coloring
+ o new implementation Imperative.Digraph.ConcreteBidirectional
+   that maintains the set of ingoing edges for each node, thus improving the
+   efficiency of functions such as iter_pred, pred, in_degree, etc.
+   (contributed by Ted Kremenek)
+
+version 0.95, November 2nd, 2005
+--------------------------------
+ o compatibility with ocaml 3.09
+ o new module Path.Check to check for paths
+
+version 0.94, July 6th, 2005
+----------------------------
+ o new module Gml to parse and print graphs in GML file format
+   (see http://www.infosun.fmi.uni-passau.de/Graphlet/GML)
+   corresponding functions parse_gml_file and print_gml_file in Pack
+ o added display_with_gv in Pack
+ o improved implementation of Unionfind (patch by Marc Lasson)
+
+version 0.93, March 31st, 2005
+------------------------------
+ o fixed bug in Rand (integer overflow causing Invalid_argument "random");
+   improved code in Rand
+ o bug fixed in the META file
+ o add find_edge in Sig.G (and so in all graph implementations)
+
+version 0.92, January 18th, 2005
+--------------------------------
+ o fixed escaped labels in Graphviz output (patch by Boris Yakobowski)
+ o new Graphviz option OrderingOut (patch by Boris Yakobowski)
+ o fixed sharing bugs in Oper (patch by Boris Yakobowski)
+ o fixed bug in nb_edges for undirected graphs
+ o improvement of iterators of undirected concrete graphs
+
+version 0.91, December 16th, 2004
+---------------------------------
+ o more precise specifications of remove_edge and shortest_path.
+ o bug fixed in mem_edge_e of labelled graphs
+ o generation of random graphs improved
+ o add Rand.Make and Rand.Planar.Make (generic functors)
+ o add signatures Persistent.S and Imperative.S
+
+version 0.90, November 30th, 2004
+---------------------------------
+ o graph.cma graph.cmxa
+ o version.ml and META files are now writable
+ o add interfaces Sig.VERTEX and Sig.EDGE
+ o "sig.ml" and "sig_pack.ml" removed; ocamlgraph now requires ocaml 3.08.0
+ o improvement of Minsep
+ o add Components.scc_list
+ o Oper.Neighbourhood replaces Neighborhood
+ o Gmap replaces Copy
+ o add types Sig_pack.vertex and Sig_pack.edge
+ o fixed bug in Ford-Fulkerson: G.V.equal instead of = in two asserts
+
+version 0.81, July 13th, 2004
+-----------------------------
+ o compatibility with ocaml 3.08
+ o Oper.Choose.choose_edge: choose an edge in a graph
+ o add types Sig.G.edge and Sig.G.vertex resp. equal to Sig.G.V.t and Sig.G.E.t
+ o fixed typos in invalid_arg arguments (in Bitv)
+
+version 0.80, June 28th, 2004
+-----------------------------
+ o major contribution by Matthieu Sozeau and Pierre-Lo�c Garoche.
+   New modules are:
+   - Md: Minimum Degree algorithm
+   - Cliquetree: the clique tree of a graph
+   - Mcs_m: Maximal Cardinality Search (MCS-M) algorithm
+   - Minsep: Minimal separators of a graph
+   - Neighborhood: compute the neighborhood of a vertex/some vertices
+   - Oper.Difference: subgraphs induced by the elimination of some vertices
+   - Oper.Choose: choose a vertex in a graph
+   - Copy: graphs copying
+   - Util.DataV: create a vertex type with data attached to it
+ o out_degree: raises Invalid_argument if v not in g (instead of Not_found)
+ o Pack.Graph: golberg/ford_fulkerson fail ("not a directed graph")
+
+version 0.70, Feb 27th, 2004
+----------------------------
+ o Makefile.in: dependences ("make -j" works)
+ o union and intersection (see Oper.S.union and Oper.S.intersection)
+ o Golberg/Ford_fulkerson algorithms in a single module Flow
+ o step-by-step iterators in Traverse.{Dfs,Bfs}
+ o Ford_fulkerson: maxflow now returns a flow function over edges
+
+version 0.60, Feb 18th, 2004
+----------------------------
+ o fixed bug in Ford-Fulkerson
+ o random planar graphs (see Rand.Planar)
+ o Delaunay triangulation (see Delaunay)
+ o implementations with adjacency matrices (see Imperative.Matrix)
+ o operations on predecessors for undirected graphs optimized
+ o Traverse.Dfs.{prefix,prefix_component} optimized (now tail recursive)
+
+version 0.50, Feb 4th, 2004
+---------------------------
+ o first release
+
+Local Variables:
+mode: text
+End:

File ocamlgraph/ocamlgraph-1.7/COPYING

+Ocamlgraph: a generic graph library for ocaml
+Copyright (C) 2004-2010
+Sylvain Conchon, Jean-Christophe Filli�tre and Julien Signoles
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Library General Public
+License version 2.1, as published by the Free Software Foundation.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+
+See the GNU Library General Public License version 2.1 for more details
+(enclosed in the file LICENSE).

File ocamlgraph/ocamlgraph-1.7/CREDITS

+
+Contributors, in alphabetic order 
+
+  Sylvain Conchon
+  Jean-Christophe Filli�tre
+  Fran�ois Pottier
+  Julien Signoles
+  Vincent Simonet
+  Matthieu Sozeau

File ocamlgraph/ocamlgraph-1.7/FAQ

+==========================
+FREQUENTLY ASKED QUESTIONS
+==========================
+
+==========
+Q: I need to store some information into vertices and/or edges
+   I need several kind of labels on the edges
+-----
+A: Use one of the functor implementation provided in Persistent or Imperative.
+   If for instance you want mutable directed graphs with colored vertices,
+   you may do
+
+	type color = Red | Green | Blue | Yellow
+	module G = Imperative.Digraph.Abstract(struct type t = color end)
+
+  (to be able to change the color you would use `type t = color ref' instead)
+==========
+==========
+Q: How to choose between concrete and abstract vertices for my graph
+   implementation?
+-----
+A: If you fall into one of the following cases, use abstract vertices:
+   - you cannot provide efficient comparison/hash functions for vertices; or
+   - you wish to get two different vertices with the same label.
+   In other cases, it is certainly easier to use concrete vertices.
+==========
+==========
+Q: Is it possible to serialize graphs?
+-----
+A: Graphs are serializable data structures: just call [Pervasives.output_value]
+   on your graph (for example).
+
+   But abstract graphs use integer tags to identify vertices;
+   this tag is made from the global reference [Blocks.cpt_vertex].
+   There are two related issues.
+
+   1) If there are abstract vertices in RAM while unmarshalling some others,
+      you have to be sure that RAM vertices do not share tags with unmarshalled
+      ones (except if you really want that).
+
+   2) If you need to create new vertices after unserialising an abstract graph,
+      you have to:
+      - serialize [!Blocks.cpt_vertex];
+      - call function [Blocks.after_unserialization] after your unserialisation
+      process.
+
+   There is no issue with concrete graph: it may be easier to use them if
+   unmarshalling is required.
+==========
+==========
+Q: I need Foobar-Tarjan algorithm and it is not provided
+-----
+A: Please contribute by sending us the code :-) See next question.
+==========
+==========
+Q: How can I contribute to this library?
+-----
+A: You can contribute either with a graph data structure or with an algorithm
+   over graphs. For the former, please follow the signatures given in module
+   Sig. For the latter, write your algorithm as a functor, following examples
+   in modules Path, Flow, Components, etc.
+==========
+==========
+Q: Your implementation of algorithm AAA could be greatly improved provided
+   you add this and this into the graph data structure
+-----
+A: Of course yes. But the idea behind ocamlgraph is to be as generic as
+   possible (any algorithm should be useable on any implementation).
+
+   When the graph data structure provides additional capabilities
+   (such as marking, etc.) it is possible to provide a more efficient
+   implementation into some specialized functor. See module Traverse for
+   instance (where DFS and cycle detection are optimized for imperative
+   graphs equipped with marks)
+==========
+==========
+Q: I have a graph implementation with polymorphic types for vertices or edges
+   and thus I can't apply the algorithms functors
+-----
+A: Here we bump into Ocaml's type system limitations: the number of type
+   parameters must be know when the functor is written and the simplest
+   choice for us was to assume no type parameter at all. (This is exactly the
+   same for functors Set.Make or Map.Make from Ocaml standard library.)
+   As a (bad) workaround, you can copy the functor body and substitute your
+   own functions for the functor arguments.
+==========

File ocamlgraph/ocamlgraph-1.7/INSTALL

+
+===========================
+How to create the library ?
+===========================
+
+You need Objective Caml >= 3.10.2 to compile this library.
+
+Configure with 
+
+	./configure
+
+Compile with
+
+	make
+
+Install (as root if needed) with
+
+	make install
+
+findlib users may also do
+
+	make install-findlib
+
+=================================
+How to create the documentation ?
+=================================
+
+create a local documentation with
+
+	make doc

File ocamlgraph/ocamlgraph-1.7/LICENSE

+The Library is distributed under the terms of the GNU Library General
+Public License version 2.1 (included below). 
+
+As a special exception to the GNU Library General Public License, you
+may link, statically or dynamically, a "work that uses the Library"
+with a publicly distributed version of the Library to produce an
+executable file containing portions of the Library, and distribute
+that executable file under terms of your choice, without any of the
+additional requirements listed in clause 6 of the GNU Library General
+Public License. By "a publicly distributed version of the Library", we
+mean either the unmodified Library as distributed, or a
+modified version of the Library that is distributed under the
+conditions defined in clause 3 of the GNU Library General Public
+License. This exception does not however invalidate any other reasons
+why the executable file might be covered by the GNU Library General
+Public License.  
+
+======================================================================
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+	51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations
+below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it
+becomes a de-facto standard.  To achieve this, non-free programs must
+be allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control
+compilation and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at least
+    three years, to give the same user the materials specified in
+    Subsection 6a, above, for a charge no more than the cost of
+    performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply, and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License
+may add an explicit geographical distribution limitation excluding those
+countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms
+of the ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.
+It is safest to attach them to the start of each source file to most
+effectively convey the exclusion of warranty; and each file should
+have at least the "copyright" line and a pointer to where the full
+notice is found.
+
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or
+your school, if any, to sign a "copyright disclaimer" for the library,
+if necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James
+  Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+

File ocamlgraph/ocamlgraph-1.7/META.in

+version = "VERSION"
+description = "Generic Graph Library"
+requires=""
+archive(byte) = "CMA"
+archive(native) = "CMXA"

File ocamlgraph/ocamlgraph-1.7/Makefile.in

+##########################################################################
+#                                                                        #
+#  Ocamlgraph: a generic graph library for OCaml                         #
+#  Copyright (C) 2004-2010                                               #
+#  Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles        #
+#                                                                        #
+#  This software is free software; you can redistribute it and/or        #
+#  modify it under the terms of the GNU Library General Public           #
+#  License version 2.1, with the special exception on linking            #
+#  described in file LICENSE.                                            #
+#                                                                        #
+#  This software is distributed in the hope that it will be useful,      #
+#  but WITHOUT ANY WARRANTY; without even the implied warranty of        #
+#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                  #
+#                                                                        #
+##########################################################################
+
+# Where to install the binaries
+DESTDIR	=
+prefix	=@prefix@
+exec_prefix=@exec_prefix@
+datarootdir=@datarootdir@
+BINDIR	=$(DESTDIR)@bindir@
+
+# Where to install the man page
+MANDIR=@mandir@
+
+# Other variables set by ./configure
+OCAMLC   = @OCAMLC@
+OCAMLOPT = @OCAMLOPT@
+OCAMLDEP = @OCAMLDEP@ -slash
+OCAMLDOC = @OCAMLDOC@
+OCAMLLEX = @OCAMLLEX@
+OCAMLYACC= @OCAMLYACC@
+OCAMLLIB = @OCAMLLIB@
+OCAMLBEST= @OCAMLBEST@
+OCAMLVERSION = @OCAMLVERSION@
+OCAMLWEB = @OCAMLWEB@
+OCAMLWIN32 = @OCAMLWIN32@
+OCAMLFIND = @OCAMLFIND@
+EXE = @EXE@
+LIBEXT = @LIBEXT@
+OBJEXT = @OBJEXT@
+
+# Others global variables
+SRCDIR	= src
+LIBDIR	= lib
+
+INCLUDES= -I $(SRCDIR) -I $(LIBDIR)
+BFLAGS = $(INCLUDES) -g -dtypes
+OFLAGS = $(INCLUDES)
+
+# main target
+#############
+
+NAME=ocamlgraph
+
+ifeq (@LABLGNOMECANVAS@,yes)
+all: byte $(OCAMLBEST) viewer dgraph editor
+else
+all: byte $(OCAMLBEST)
+endif
+
+# bytecode and native-code compilation
+######################################
+
+LIB= unionfind heap bitv
+LIB:=$(patsubst %, $(LIBDIR)/%.cmo, $(LIB))
+
+CMO = 	version util blocks persistent imperative \
+	delaunay builder classic rand oper \
+	path traverse coloring topological components kruskal flow \
+        graphviz gml dot_parser dot_lexer dot pack \
+	gmap minsep cliquetree mcs_m md strat
+CMO := $(LIB) $(patsubst %, $(SRCDIR)/%.cmo, $(CMO))
+
+CMX = $(CMO:.cmo=.cmx)
+CMA = graph.cma
+CMXA = graph.cmxa
+
+CMI = sig sig_pack dot_ast
+CMI := $(patsubst %, src/%.cmi, $(CMI))
+
+GENERATED = META \
+	src/gml.ml src/version.ml \
+	src/dot_parser.ml src/dot_parser.mli src/dot_lexer.ml
+
+$(CMX): OFLAGS += -for-pack Graph
+
+byte: $(CMA)
+opt: $(CMXA)
+
+graph.cma: graph.cmo
+	$(OCAMLC) $(INCLUDES) -a -o $@ $^
+
+graph.cmxa: graph.cmx
+	$(OCAMLOPT) $(INCLUDES) -a -o $@ $^
+
+graph.cmi: graph.cmo
+graph.o: graph.cmx
+
+graph.cmo: $(CMI) $(CMO)
+	$(OCAMLC) $(INCLUDES) -pack -o $@ $^
+
+graph.cmx: $(CMI) $(CMX)
+	$(OCAMLOPT) $(INCLUDES) -pack -o $@ $^
+
+VERSION=1.7
+
+src/version.ml: Makefile
+	rm -f $@
+	echo "let version = \""$(VERSION)"\"" > $@
+	echo "let date = \""`date`"\"" >> $@
+
+# gtk2 graph editor
+###################
+
+ED_DIR=editor
+
+editor: $(ED_DIR)/editor.byte $(ED_DIR)/editor.$(OCAMLBEST)
+
+ED_CMO = ed_hyper ed_graph ed_draw ed_display ed_main
+ED_CMO:= $(patsubst %, $(ED_DIR)/%.cmo, $(ED_CMO))
+ED_CMX = $(ED_CMO:.cmo=.cmx)
+ED_CMI = $(ED_CMO:.cmo=.cmi)
+
+ED_INCLUDES = @INCLUDEGTK2@ -I +threads -I $(ED_DIR) $(INCLUDES) -I .
+
+$(ED_CMI) $(ED_CMO): BFLAGS+= $(ED_INCLUDES)
+$(ED_CMI) $(ED_CMO): $(CMA)
+$(ED_CMX): OFLAGS+= $(ED_INCLUDES)
+$(ED_CMX): $(CMXA)
+
+$(ED_DIR)/editor.byte: $(CMA) $(ED_CMO)
+	$(OCAMLC) -g -o $@ $(ED_INCLUDES) \
+		lablgtk.cma lablgnomecanvas.cma unix.cma $^
+
+$(ED_DIR)/editor.opt: $(CMXA) $(ED_CMX)
+	$(OCAMLOPT) -o $@ $(ED_INCLUDES) \
+		lablgtk.cmxa lablgnomecanvas.cmxa unix.cmxa $^
+
+# gtk2 graph viewer (deprecated)
+###################
+
+VIEWER_DIR=view_graph
+
+viewer: $(VIEWER_DIR)/viewgraph.byte $(VIEWER_DIR)/viewgraph.$(OCAMLBEST)
+
+VIEWER_CMO=viewGraph_core viewGraph_select viewGraph_utils viewGraph_test
+VIEWER_CMO:=$(patsubst %,$(VIEWER_DIR)/%.cmo, $(VIEWER_CMO))
+VIEWER_CMX=$(VIEWER_CMO:.cmo=.cmx)
+VIEWER_CMI=$(VIEWER_CMO:.cmo=.cmi)
+VIEWER_MLI=$(VIEWER_CMI:.cmi=.mli)
+
+VIEWER_INCLUDES= @INCLUDEGTK2@ -I $(VIEWER_DIR) $(INCLUDES) -I .
+
+$(VIEWER_CMI) $(VIEWER_CMO): BFLAGS+= $(VIEWER_INCLUDES)
+$(VIEWER_CMX): OFLAGS+= $(VIEWER_INCLUDES) -for-pack Viewgraph
+$(VIEWER_CMI) $(VIEWER_CMO): $(CMA)
+$(VIEWER_CMX): $(CMXA)
+
+VIEWER_CMOLIB	= $(VIEWER_DIR)/viewgraph.cmo
+VIEWER_CMILIB	= $(VIEWER_DIR)/viewgraph.cmi
+VIEWER_CMXLIB	= $(VIEWER_DIR)/viewgraph.cmx
+
+$(VIEWER_CMOLIB): $(filter-out $(VIEWER_DIR)/viewGraph_test.cmo, $(VIEWER_CMO))
+	$(OCAMLC) -o $@ $(VIEWER_INCLUDES) -pack $^
+
+$(VIEWER_CMXLIB): $(filter-out $(VIEWER_DIR)/viewGraph_test.cmx, $(VIEWER_CMX))
+	$(OCAMLOPT) -o $@ $(VIEWER_INCLUDES) -pack $^
+
+$(VIEWER_DIR)/viewgraph.byte: $(CMA) $(VIEWER_CMOLIB)
+	$(OCAMLC) -g -o $@ $(VIEWER_INCLUDES) \
+		lablgtk.cma gtkInit.cmo lablgnomecanvas.cma unix.cma $^
+
+$(VIEWER_DIR)/viewgraph.opt: $(CMXA) $(VIEWER_CMXLIB)
+	$(OCAMLOPT) -o $@ $(VIEWER_INCLUDES) \
+		lablgtk.cmxa gtkInit.cmx lablgnomecanvas.cmxa unix.cmxa $^
+
+# new gtk2 graph viewer: dgraph
+###############################
+
+DGRAPH_DIR=dgraph
+
+dgraph: $(DGRAPH_DIR)/dgraph.byte $(DGRAPH_DIR)/dgraph.$(OCAMLBEST)
+
+DGRAPH_CMO=xDotDraw xDot \
+	dGraphModel \
+	dGraphTreeLayout dGraphSubTree dGraphTreeModel \
+	dGraphViewItem dGraphView \
+	dGraphRandModel dGraphContainer \
+	dGraphViewer
+DGRAPH_CMO:=$(patsubst %,$(DGRAPH_DIR)/%.cmo, $(DGRAPH_CMO))
+DGRAPH_CMX=$(DGRAPH_CMO:.cmo=.cmx)
+DGRAPH_CMI=$(filter-out dgraph/dGraphViewer.cmi, $(DGRAPH_CMO:.cmo=.cmi))
+
+DGRAPH_INCLUDES= @INCLUDEGTK2@ -I $(DGRAPH_DIR) $(INCLUDES) -I .
+
+$(DGRAPH_CMI) $(DGRAPH_CMO): BFLAGS+= $(DGRAPH_INCLUDES)
+$(DGRAPH_CMX): OFLAGS+= $(DGRAPH_INCLUDES) -for-pack Dgraph
+
+$(DGRAPH_CMI) $(DGRAPH_CMO): $(CMA)
+$(DGRAPH_CMX): $(CMXA)
+
+DGRAPH_CMOLIB	= $(DGRAPH_DIR)/dgraph.cmo
+DGRAPH_CMILIB	= $(DGRAPH_DIR)/dgraph.cmi
+DGRAPH_CMXLIB	= $(DGRAPH_DIR)/dgraph.cmx
+
+
+dgraph/dGraphViewer.cmo: $(DGRAPH_CMOLIB)
+dgraph/dGraphViewer.cmx: $(DGRAPH_CMXLIB)
+
+$(DGRAPH_CMOLIB): $(filter-out dgraph/dGraphViewer.cmo, $(DGRAPH_CMO))
+	$(OCAMLC) -o $@ $(DGRAPH_INCLUDES) -pack $^
+
+$(DGRAPH_CMXLIB): $(filter-out dgraph/dGraphViewer.cmx, $(DGRAPH_CMX))
+	$(OCAMLOPT) -o $@ $(DGRAPH_INCLUDES) -pack $^
+
+$(DGRAPH_DIR)/dgraph.byte: $(CMA) $(DGRAPH_CMOLIB) \
+  $(DGRAPH_DIR)/dGraphViewer.cmo
+	$(OCAMLC) -g -o $@ $(DGRAPH_INCLUDES) \
+		lablgtk.cma gtkInit.cmo lablgnomecanvas.cma $^
+
+$(DGRAPH_DIR)/dgraph.opt: $(CMXA) $(DGRAPH_CMXLIB) \
+  $(DGRAPH_DIR)/dGraphViewer.cmx
+	$(OCAMLOPT) -o $@ $(DGRAPH_INCLUDES) \
+		lablgtk.cmxa gtkInit.cmx lablgnomecanvas.cmxa $^
+
+# Examples
+##########
+
+EXAMPLESBIN=bin/demo.$(OCAMLBEST) bin/demo_planar.$(OCAMLBEST) \
+  bin/bench.$(OCAMLBEST) bin/color.$(OCAMLBEST) bin/sudoku.$(OCAMLBEST) \
+  bin/test.$(OCAMLBEST)
+
+.PHONY: examples
+examples: $(EXAMPLESBIN)
+
+.PHONY: demo
+demo: bin/demo.$(OCAMLBEST)
+
+bin/demo.byte: $(CMA) examples/demo.cmo
+	$(OCAMLC) -o $@ $^
+
+bin/demo.opt: $(CMXA) examples/demo.cmx
+	$(OCAMLOPT) -o $@ $^
+
+bin/demo_planar.byte: $(CMA) examples/demo_planar.cmo
+	$(OCAMLC) -o $@ graphics.cma unix.cma $^
+
+bin/demo_planar.opt: $(CMXA) examples/demo_planar.cmx
+	$(OCAMLOPT) -o $@ graphics.cmxa unix.cmxa $^
+
+bin/color.byte: $(CMA) examples/color.cmo
+	$(OCAMLC) -o $@ graphics.cma unix.cma $^
+
+bin/color.opt: $(CMXA) examples/color.cmx
+	$(OCAMLOPT) -o $@ graphics.cmxa unix.cmxa $^
+
+bin/sudoku.byte: $(CMA) examples/sudoku.cmo
+	$(OCAMLC) -o $@ graphics.cma unix.cma $^
+
+bin/sudoku.opt: $(CMXA) examples/sudoku.cmx
+	$(OCAMLOPT) -o $@ graphics.cmxa unix.cmxa $^
+
+test: $(CMA) tests/test.ml
+	ocaml unix.cma graphics.cma $^
+
+bin/test.byte: $(CMA) tests/test.cmo
+	$(OCAMLC) -g -unsafe -o $@ unix.cma graphics.cma $^
+
+bin/test.opt: $(CMXA) tests/test.cmx
+	$(OCAMLOPT) -unsafe -inline 100 -o $@ unix.cmxa graphics.cmxa $^
+
+bench: bin/bench.$(OCAMLBEST)
+	bin/bench.opt
+
+bin/bench.opt: $(CMXA) tests/bench.ml
+	$(OCAMLOPT) -unsafe -inline 100 -o $@ unix.cmxa $^
+
+check: $(CMA) tests/check.ml
+	ocaml $^
+
+# Additional rules
+##################
+
+EXAMPLES = demo color demo_planar sudoku
+EXAMPLESBIN:=$(patsubst %, bin/%.opt, $(EXAMPLES))
+EXAMPLES:= $(patsubst %, examples/%.ml, $(EXAMPLES))
+
+examples: $(EXAMPLESBIN)
+
+TESTS = test check
+TESTS := $(patsubst %, tests/%.ml, $(TESTS))
+
+DPD_GRAPH_ML= $(TESTS) $(EXAMPLES)
+
+$(DPD_GRAPH_ML:.ml=.cmo): $(CMA)
+$(DPD_GRAPH_ML:.ml=.cmx): $(CMXA)
+
+# installation
+##############
+
+INSTALL_LIBDIR=$(DESTDIR)$(OCAMLLIB)/ocamlgraph
+
+install: install-$(OCAMLBEST) install-byte
+	mkdir -p $(BINDIR)
+ifeq (@LABLGNOMECANVAS@,yes)
+ifeq ($(OCAMLBEST),byte)
+	cp -f $(BINDIR)/graph-editor.byte $(BINDIR)/graph-editor$(EXE)
+	cp -f $(BINDIR)/graph-viewer.byte $(BINDIR)/graph-viewer$(EXE)
+else
+	cp -f $(BINDIR)/graph-editor.opt $(BINDIR)/graph-editor$(EXE)
+	cp -f $(BINDIR)/graph-viewer.opt $(BINDIR)/graph-viewer$(EXE)
+endif
+endif
+
+install-byte:
+	mkdir -p $(INSTALL_LIBDIR)
+	cp -f graph.cmo graph.cmi $(CMA) $(INSTALL_LIBDIR)
+	cp -f $(SRCDIR)/*.mli $(INSTALL_LIBDIR)
+ifeq (@LABLGNOMECANVAS@,yes)
+	mkdir -p $(BINDIR)
+	cp -f $(ED_DIR)/editor.byte $(BINDIR)/graph-editor.byte
+	cp -f $(VIEWER_CMILIB) $(VIEWER_CMOLIB) $(INSTALL_LIBDIR)
+	cp -f $(DGRAPH_CMILIB) $(DGRAPH_CMOLIB) $(INSTALL_LIBDIR)
+	cp -f $(VIEWER_DIR)/*.mli $(DGRAPH_DIR)/*.mli $(INSTALL_LIBDIR)
+	cp -f $(DGRAPH_DIR)/dgraph.byte $(BINDIR)/graph-viewer.byte
+endif
+
+install-opt: install-byte
+	mkdir -p $(INSTALL_LIBDIR)
+	cp -f graph$(LIBEXT) graph.cmi graph.cmx $(CMXA) $(INSTALL_LIBDIR)
+	cp -f $(SRCDIR)/*.mli $(INSTALL_LIBDIR)
+ifeq (@LABLGNOMECANVAS@,yes)
+	mkdir -p $(BINDIR)
+	cp -f $(ED_DIR)/editor.opt $(BINDIR)/graph-editor.opt
+	cp -f $(VIEWER_CMILIB) $(VIEWER_CMXLIB) $(VIEWER_CMXLIB:.cmx=.o) \
+		$(INSTALL_LIBDIR)
+	cp -f $(DGRAPH_CMILIB) $(DGRAPH_CMXLIB) $(DGRAPH_CMXLIB:.cmx=.o) \
+		$(INSTALL_LIBDIR)
+	cp -f $(DGRAPH_DIR)/dgraph.opt $(BINDIR)/graph-viewer.opt
+	cp -f $(VIEWER_DIR)/*.mli $(DGRAPH_DIR)/*.mli $(INSTALL_LIBDIR)
+endif
+
+install-findlib: META
+ifdef OCAMLFIND
+ifeq (@LABLGNOMECANVAS@,yes)
+	$(OCAMLFIND) install ocamlgraph META \
+		$(SRCDIR)/*.mli $(VIEWER_DIR)/*.mli $(DGRAPH_DIR)/*.mli \
+		graph$(LIBEXT) graph.cmx graph.cmo graph.cmi $(CMA) $(CMXA) \
+		$(VIEWER_CMXLIB) $(VIEWER_CMOLIB) $(DGRAPH_CMX) $(DGRAPH_CMO)
+else
+	$(OCAMLFIND) install ocamlgraph META \
+		$(SRCDIR)/*.mli $(VIEWER_DIR)/*.mli $(DGRAPH_DIR)/*.mli \
+		graph$(LIBEXT) graph.cmx graph.cmo graph.cmi $(CMA) $(CMXA)
+endif
+endif
+
+META: META.in Makefile
+	sed -e s/VERSION/$(VERSION)/ -e s/CMA/$(CMA)/ -e s/CMXA/$(CMXA)/ \
+		$@.in > $@
+
+# documentation
+###############
+
+DOCFILES=$(NAME).ps $(NAME).html
+
+NODOC	= blocks dot_parser dot_lexer version
+NODOC	:= $(patsubst %, $(SRCDIR)/%.cmo, $(NODOC))
+DOC_CMO	= $(filter-out $(NODOC) $(LIB), $(CMO))
+DOC_SRC	= $(CMI:.cmi=.mli) $(DOC_CMO:.cmo=.mli) $(DOC_CMO:.cmo=.ml)
+ifeq (@LABLGNOMECANVAS@,yes)
+DOC_SRC := $(DOC_SRC) $(DGRAPH_CMI:.cmi=.mli)
+endif
+
+.PHONY: doc
+doc: $(DOC_CMO)
+	mkdir -p doc
+	rm -f doc/*
+	$(OCAMLDOC) -d doc -html $(DGRAPH_INCLUDES) $(DOC_SRC)
+
+# literate programming
+$(NAME).tex: $(DOC_SRC)
+	$(OCAMLWEB) -o $@ $^
+
+wc:
+	ocamlwc -p $(SRCDIRC)/*.mli $(SRCDIRC)/*.ml
+
+# file headers
+##############
+
+headers:
+	headache \
+	   -c misc/headache_config.txt \
+	   -h misc/header.txt \
+	   Makefile.in configure.in README \
+	   $(LIBDIR)/*.ml $(LIBDIR)/*.ml[ily] \
+	   $(SRCDIR)/*.ml $(SRCDIR)/*.ml[ily] \
+	   $(ED_DIR)/*.ml $(ED_DIR)/*.mli
+	headache \
+           -c misc/headache_config.txt \
+	   -h $(DGRAPH_DIR)/headers/CEA_LGPL \
+	   $(DGRAPH_DIR)/*.ml $(DGRAPH_DIR)/*.mli
+# export
+########
+
+EXPORTDIR=$(NAME)-$(VERSION)
+TAR=$(EXPORTDIR).tar
+
+FTP = /users/www-perso/projets/ocamlgraph/download
+WWW = /users/www-perso/projets/ocamlgraph
+
+FILES = src/*.ml* lib/*.ml* Makefile.in configure configure.in META.in  \
+	.depend editor/ed_*.ml* editor/Makefile \
+        editor/tests/*.dot editor/tests/*.gml \
+	view_graph/*.ml view_graph/*.mli \
+	view_graph/README view_graph/Makefile \
+	dgraph/*.ml dgraph/*.mli \
+	examples/*.ml tests/*.ml \
+	README FAQ CREDITS INSTALL COPYING LICENSE CHANGES
+
+export: source export-doc export-web export-delaunay
+
+source:
+	mkdir -p export
+	cd export; rm -rf $(EXPORTDIR)
+	mkdir -p export/$(EXPORTDIR)/bin
+	cp --parents $(FILES) export/$(EXPORTDIR)
+	cd export ; tar cf $(TAR) $(EXPORTDIR) ; gzip -f --best $(TAR)
+	cp export/$(TAR).gz $(FTP)
+	cp README FAQ CREDITS COPYING LICENSE CHANGES $(EXAMPLES) $(FTP)
+
+# Build and install the .tar.gz requiered by Frama-C
+framac: EXPORTDIR=ocamlgraph
+framac: FTP=$$HOME/frama-c
+framac:
+	mkdir -p export
+	cd export; rm -rf $(EXPORTDIR)
+	mkdir -p export/$(EXPORTDIR)/bin
+	cp --parents $(FILES) export/$(EXPORTDIR)
+	cd export ; tar cf $(TAR) $(EXPORTDIR) ; gzip -f --best $(TAR)
+	cp export/$(TAR).gz $(FTP)
+	make -C $(FTP) force-ocamlgraph
+
+www/version.prehtml: Makefile.in
+	echo "<#def version>$(VERSION)</#def>" > www/version.prehtml
+
+export-web: www/version.prehtml
+	make -C www install
+
+export-doc: $(DOC_CMO)
+	rm -f $(WWW)/doc/*
+	-$(OCAMLDOC) -d $(WWW)/doc -html $(DGRAPH_INCLUDES) $(DOC_SRC)
+
+MISCFTP = $(HOME)/WWW/ftp/ocaml/misc
+DELAUNAY=delaunay.ml delaunay.mli
+export-delaunay:
+	cd src; cp -f $(DELAUNAY) $(MISCFTP)
+	cd src; caml2html -noannot -d $(MISCFTP) $(DELAUNAY)
+
+# generic rules
+###############
+
+.SUFFIXES: .mli .ml .cmi .cmo .cmx .mll .mly .tex .dvi .ps .html
+
+.mli.cmi:
+	$(OCAMLC) -c $(BFLAGS) $<
+
+.ml.cmo:
+	$(OCAMLC) -c $(BFLAGS) $<
+
+.ml.o:
+	$(OCAMLOPT) -c $(OFLAGS) $<
+
+.ml.cmx:
+	$(OCAMLOPT) -c $(OFLAGS) $<
+
+.mll.ml:
+	$(OCAMLLEX) $<
+
+.mly.ml:
+	$(OCAMLYACC) -v $<
+
+.mly.mli:
+	$(OCAMLYACC) -v $<
+
+.tex.dvi:
+	latex $< && latex $<
+
+.dvi.ps:
+	dvips $< -o $@
+
+.tex.html:
+	hevea $<
+
+# Emacs tags
+############
+
+otags:
+	otags -r src editor view_graph
+
+tags:
+	find . -name "*.ml*" | sort -r | xargs \
+	etags "--regex=/let[ \t]+\([^ \t]+\)/\1/" \
+	      "--regex=/let[ \t]+rec[ \t]+\([^ \t]+\)/\1/" \
+	      "--regex=/and[ \t]+\([^ \t]+\)/\1/" \
+	      "--regex=/type[ \t]+\([^ \t]+\)/\1/" \
+              "--regex=/exception[ \t]+\([^ \t]+\)/\1/" \
+	      "--regex=/val[ \t]+\([^ \t]+\)/\1/" \
+	      "--regex=/module[ \t]+\([^ \t]+\)/\1/"
+
+# Makefile is rebuilt whenever Makefile.in or configure.in is modified
+######################################################################
+
+Makefile: Makefile.in config.status
+	if test -e $@; then chmod a+w $@; fi
+	./config.status
+	chmod a-w $@
+
+config.status: configure
+	./config.status --recheck
+
+configure: configure.in
+	autoconf
+
+# clean
+#######
+
+clean:
+	rm -f *~
+	for d in $(SRCDIR) $(LIBDIR) $(ED_DIR) $(VIEWER_DIR) $(DGRAPH_DIR) \
+		tests examples; \
+	do \
+	  rm -f $$d/*.cm[iox] $$d/*$(OBJEXT) $$d/*~ $$d/*.annot; \
+	done
+	rm -f $(GENERATED) $(SRCDIR)/dot_parser.output
+	rm -f graph.*a graph.cm* graph.o graph$(LIBEXT)
+	rm -f $(ED_DIR)/editor.byte $(ED_DIR)/editor.opt
+	rm -f $(VIEWER_DIR)/viewgraph.byte $(VIEWER_DIR)/viewgraph.opt
+	rm -f $(DGRAPH_DIR)/dgraph.byte $(DGRAPH_DIR)/dgraph.opt
+	rm -f $(DGRAPH_DIR)/dgraph
+	rm -f *.haux *.aux *.log $(NAME).tex $(NAME).dvi $(DOCFILES)
+	rm -f $(EXAMPLESBIN)
+
+dist-clean distclean:: clean
+	rm -f Makefile config.cache config.log config.status *.byte *.opt
+
+svnclean svn-clean:: dist-clean
+	rm -f config.* configure configure.lineno
+
+# depend
+########
+
+.PHONY: depend
+.depend depend: $(GENERATED)
+	rm -f .depend
+	$(OCAMLDEP) $(INCLUDES) -I $(ED_DIR) -I $(VIEWER_DIR) -I $(DGRAPH_DIR)\
+		$(LIBDIR)/*.ml $(LIBDIR)/*.mli \
+		$(SRCDIR)/*.ml $(SRCDIR)/*.mli \
+		$(ED_DIR)/*.mli $(ED_DIR)/*.ml \
+		$(VIEWER_DIR)/*.mli $(VIEWER_DIR)/*.ml \
+		$(DGRAPH_DIR)/*.mli $(DGRAPH_DIR)/*.ml > .depend
+
+include .depend

File ocamlgraph/ocamlgraph-1.7/README

+**************************************************************************
+*                                                                        *
+*  Ocamlgraph: a generic graph library for OCaml                         *
+*  Copyright (C) 2004-2010                                               *
+*  Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles        *
+*                                                                        *
+*  This software is free software; you can redistribute it and/or        *
+*  modify it under the terms of the GNU Library General Public           *
+*  License version 2.1, with the special exception on linking            *
+*  described in file LICENSE.                                            *
+*                                                                        *
+*  This software is distributed in the hope that it will be useful,      *
+*  but WITHOUT ANY WARRANTY; without even the implied warranty of        *
+*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                  *
+*                                                                        *
+**************************************************************************
+
+
+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