---
- branch: MAIN
  date: Fri Jun 17 16:31:30 UTC 2016
  files:
  - new: '1.12'
    old: '1.11'
    path: pkgsrc/devel/ocamlgraph/Makefile
    pathrev: pkgsrc/devel/ocamlgraph/Makefile@1.12
    type: modified
  - new: '1.2'
    old: '1.1'
    path: pkgsrc/devel/ocamlgraph/PLIST
    pathrev: pkgsrc/devel/ocamlgraph/PLIST@1.2
    type: modified
  - new: '1.3'
    old: '1.2'
    path: pkgsrc/devel/ocamlgraph/distinfo
    pathrev: pkgsrc/devel/ocamlgraph/distinfo@1.3
    type: modified
  - new: '1.2'
    old: '1.1'
    path: pkgsrc/devel/ocamlgraph/patches/patch-Makefile.in
    pathrev: pkgsrc/devel/ocamlgraph/patches/patch-Makefile.in@1.2
    type: modified
  id: 20160617T163130Z.9694fd085e50c7e3436d40499d355485d444e75f
  log: |
    Updated package to latest version, 1.8.7. Changes include:

    version 1.8.7, April 12, 2016
    -----------------------------
     o fixed examples/demo.ml so that it also compiles with an installed OCamlGraph
     o [Components] fixed stack overflow with [scc] (patch by Albin Coquereau)
     o [Dominator] fixed stack overflow (patch by Albin Coquereau)
     o new functor [Path.Johnson] to compute all pairs of shortest paths
       using Johnson's algorithm (contributed by M�rio Pereira)
     o fixed configuration on Windows (patch by Martin R. Neuh�u�er)
     o new functor [Components.Undirected] to compute connected components
     o Graphviz: fixed printing of attribute BgcolorWithTransparency
     * Prim, Nonnegative: function weight now has the more general type "edge -> t"
       (to be consistent with Path)
     o new module type Sig.WEIGHT (used in Path, Prim, and Nonnegative)
     o Fixpoint: do not catch Not_found raised by a user-provided function.
     o Adding folds to BFS.

    version 1.8.6, January 23, 2015
    -------------------------------
     * Dominator: new functor [Make_graph] with may use graph building operations,
       while the old functor [Make] now only requires a read-only graph.
       Function [compute_all] and [compute_dom_graph] are now only defined in the
       new [Make_graph] functor.
     o Graphviz: support for additional polygonal-shapes
     o New module Clique (contributed by Giselle Reis)
     o Avoid ocamldoc error with OCaml 4.02
     * Path: function weight now has the more general type "edge -> t"
       (contributed by Steffen Smolka)
       update your code by turning "weight l" into "weight (G.E.label e)"
     o installation: "make install-findlib" now uses DESTDIR when defined
     o Traverse: documentation is clarified: providing iterators over the roots of
       the graph is enough.
     o Imperative concreate (di)graph: fix bug of functions add_edge* of imperative
       concrete (di)graphs which appears when the added edge [e] was already in the
       graph [g] and one of the vertices of [e] is equal to another vertex of [g]
       (when using the user-defined equality [G.V.equal]), but not physically equal
       to it. This bug only occurs with OCaml version >= 4.0.
     o functions in modules Components, Dominator, Flow, Topological and Traverse
       now create smaller auxiliary hash tables
     o Graphviz: add the attribute `HtmlLabel to specify html strings.
  module: pkgsrc
  subject: 'CVS commit: pkgsrc/devel/ocamlgraph'
  unixtime: '1466181090'
  user: jaapb