ocamlgraph 1.8.8-1.1 source package in Ubuntu


ocamlgraph (1.8.8-1.1) unstable; urgency=medium

  * Non-maintainer upload.
  * Add German man page translation. Closes: #866145.
  * Add Portuguese man page translation. Closes: #759173.
  * Add infrastructure to actually build and install all manpages, including
    the english one. Taken from package camomile.

 -- Helge Kreutzmann <email address hidden>  Sun, 23 Dec 2018 07:42:45 +0100

Upload details

Uploaded by:
Debian OCaml Maintainers on 2019-01-28
Uploaded to:
Original maintainer:
Debian OCaml Maintainers
any all
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Eoan release on 2019-04-18 universe libdevel
Disco release on 2019-01-30 universe libdevel


File Size SHA-256 Checksum
ocamlgraph_1.8.8-1.1.dsc 2.1 KiB afb2cb0abeab2ddab37924c529568d6e6450af4a04b4fad8c34dbd4d4be444c0
ocamlgraph_1.8.8.orig.tar.gz 283.2 KiB 414890f757cf6af6b33c3b9c54f0c03e9c0de1545872a16b10f5ec86af2e72fa
ocamlgraph_1.8.8-1.1.debian.tar.xz 13.5 KiB fcc00a1faa6ad64c5350d2ae5ab030d835918b706512fdd18b4d920599da7229

No changes file available.

Binary packages built by this source

libocamlgraph-ocaml-dev: graph library for OCaml

 Ocamlgraph is a graph library for OCaml. Its contribution is
  * It provides an easy-to-use graph data structure together with
    several operations and algorithms over graphs. It is a
    reasonably efficient imperative data structure for directed
    graphs with vertices and edges labeled with integers.
  * 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.
    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.
  * 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.

libocamlgraph-ocaml-dev-dbgsym: debug symbols for libocamlgraph-ocaml-dev
libocamlgraph-ocaml-doc: documentation for the OCamlgraph library

 This package provides the API reference documentation generated by