ocamlgraph 1.8.8-1.1build2 source package in Ubuntu

Changelog

ocamlgraph (1.8.8-1.1build2) hirsute; urgency=medium

  * No-change rebuild for ocaml abi changes.

 -- Matthias Klose <email address hidden>  Tue, 03 Nov 2020 12:00:12 +0100

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Hirsute
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
libdevel
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
ocamlgraph_1.8.8.orig.tar.gz 283.2 KiB 414890f757cf6af6b33c3b9c54f0c03e9c0de1545872a16b10f5ec86af2e72fa
ocamlgraph_1.8.8-1.1build2.debian.tar.xz 13.6 KiB 8220d5047e55d601636f23917ffe4d0cd35f732cb0313d33e37422fe5c2c711d
ocamlgraph_1.8.8-1.1build2.dsc 2.2 KiB f5a7ae27f3a1d731d4c899a4cb4f8019ca3cd082dfc5e93c9c3427bc3a9b1b27

Available diffs

View changes file

Binary packages built by this source

libocamlgraph-ocaml-dev: graph library for OCaml

 Ocamlgraph is a graph library for OCaml. Its contribution is
 three-fold:
 .
  * 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: No summary available for libocamlgraph-ocaml-dev-dbgsym in ubuntu impish.

No description available for libocamlgraph-ocaml-dev-dbgsym in ubuntu impish.

libocamlgraph-ocaml-doc: No summary available for libocamlgraph-ocaml-doc in ubuntu impish.

No description available for libocamlgraph-ocaml-doc in ubuntu impish.