pkgsrc/devel/ocamlgraph/PLIST

76 lines
3.3 KiB
Text
Raw Normal View History

@comment $NetBSD: PLIST,v 1.3 2017/10/23 13:43:31 jaapb Exp $
${PLIST.lablgtk}bin/graph-editor
${PLIST.lablgtk}bin/graph-viewer
${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/dgraph.cmi
${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/dgraph.cmo
${PLIST.ocaml-opt}${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/dgraph.cmx
${PLIST.ocaml-opt}${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/dgraph.o
${PLIST.ocaml-opt}${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/graph.o
${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/viewgraph.cmi
${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/viewgraph.cmo
${PLIST.ocaml-opt}${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/viewgraph.cmx
${PLIST.ocaml-opt}${PLIST.lablgtk}${OCAML_SITELIB}/ocamlgraph/viewgraph.o
${OCAML_SITELIB}/ocamlgraph/META
${OCAML_SITELIB}/ocamlgraph/builder.mli
${OCAML_SITELIB}/ocamlgraph/chaoticIteration.mli
${OCAML_SITELIB}/ocamlgraph/classic.mli
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.
2016-06-17 18:31:30 +02:00
${OCAML_SITELIB}/ocamlgraph/clique.mli
${OCAML_SITELIB}/ocamlgraph/cliquetree.mli
${OCAML_SITELIB}/ocamlgraph/coloring.mli
${OCAML_SITELIB}/ocamlgraph/components.mli
${OCAML_SITELIB}/ocamlgraph/contraction.mli
${OCAML_SITELIB}/ocamlgraph/dGraphContainer.mli
${OCAML_SITELIB}/ocamlgraph/dGraphModel.mli
${OCAML_SITELIB}/ocamlgraph/dGraphRandModel.mli
${OCAML_SITELIB}/ocamlgraph/dGraphSubTree.mli
${OCAML_SITELIB}/ocamlgraph/dGraphTreeLayout.mli
${OCAML_SITELIB}/ocamlgraph/dGraphTreeModel.mli
${OCAML_SITELIB}/ocamlgraph/dGraphView.mli
${OCAML_SITELIB}/ocamlgraph/dGraphViewItem.mli
${OCAML_SITELIB}/ocamlgraph/delaunay.mli
${OCAML_SITELIB}/ocamlgraph/dominator.mli
${OCAML_SITELIB}/ocamlgraph/dot.mli
${OCAML_SITELIB}/ocamlgraph/dot_ast.mli
${OCAML_SITELIB}/ocamlgraph/dot_parser.mli
${OCAML_SITELIB}/ocamlgraph/fixpoint.mli
${OCAML_SITELIB}/ocamlgraph/flow.mli
${OCAML_SITELIB}/ocamlgraph/gmap.mli
${OCAML_SITELIB}/ocamlgraph/gml.mli
${PLIST.ocaml-opt}${OCAML_SITELIB}/ocamlgraph/graph.a
${OCAML_SITELIB}/ocamlgraph/graph.cma
${OCAML_SITELIB}/ocamlgraph/graph.cmi
${OCAML_SITELIB}/ocamlgraph/graph.cmo
${PLIST.ocaml-opt}${OCAML_SITELIB}/ocamlgraph/graph.cmx
${PLIST.ocaml-opt}${OCAML_SITELIB}/ocamlgraph/graph.cmxa
${PLIST.ocaml-opt}${OCAML_SITELIB}/ocamlgraph/graph.cmxs
${PLIST.ocaml-opt}${OCAML_SITELIB}/ocamlgraph/graph.o
${OCAML_SITELIB}/ocamlgraph/graphml.mli
${OCAML_SITELIB}/ocamlgraph/graphviz.mli
${OCAML_SITELIB}/ocamlgraph/imperative.mli
${OCAML_SITELIB}/ocamlgraph/kruskal.mli
${OCAML_SITELIB}/ocamlgraph/leaderlist.mli
${OCAML_SITELIB}/ocamlgraph/mcs_m.mli
${OCAML_SITELIB}/ocamlgraph/md.mli
${OCAML_SITELIB}/ocamlgraph/merge.mli
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.
2016-06-17 18:31:30 +02:00
${OCAML_SITELIB}/ocamlgraph/mincut.mli
${OCAML_SITELIB}/ocamlgraph/minsep.mli
${OCAML_SITELIB}/ocamlgraph/nonnegative.mli
${OCAML_SITELIB}/ocamlgraph/oper.mli
${OCAML_SITELIB}/ocamlgraph/pack.mli
${OCAML_SITELIB}/ocamlgraph/path.mli
${OCAML_SITELIB}/ocamlgraph/persistent.mli
${OCAML_SITELIB}/ocamlgraph/prim.mli
${OCAML_SITELIB}/ocamlgraph/rand.mli
${OCAML_SITELIB}/ocamlgraph/sig.mli
${OCAML_SITELIB}/ocamlgraph/sig_pack.mli
${OCAML_SITELIB}/ocamlgraph/strat.mli
${OCAML_SITELIB}/ocamlgraph/topological.mli
${OCAML_SITELIB}/ocamlgraph/traverse.mli
${OCAML_SITELIB}/ocamlgraph/util.mli
${OCAML_SITELIB}/ocamlgraph/viewGraph_core.mli
${OCAML_SITELIB}/ocamlgraph/viewGraph_select.mli
${OCAML_SITELIB}/ocamlgraph/viewGraph_utils.mli
${OCAML_SITELIB}/ocamlgraph/weakTopological.mli
${OCAML_SITELIB}/ocamlgraph/xDot.mli
${OCAML_SITELIB}/ocamlgraph/xDotDraw.mli