ocamlgraph 1.8.8-1.1build1 source package in Ubuntu

Changelog

ocamlgraph (1.8.8-1.1build1) focal; urgency=medium

  * No change rebuild against new ocaml ABI

 -- Dimitri John Ledkov <email address hidden>  Fri, 21 Feb 2020 01:33:30 +0000

Upload details

Uploaded by:
Dimitri John Ledkov
Uploaded to:
Focal
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
libdevel
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release universe libdevel

Downloads

File Size SHA-256 Checksum
ocamlgraph_1.8.8.orig.tar.gz 283.2 KiB 414890f757cf6af6b33c3b9c54f0c03e9c0de1545872a16b10f5ec86af2e72fa
ocamlgraph_1.8.8-1.1build1.debian.tar.xz 13.6 KiB ac131c8e0c5e8733bff50524f7c3debd1c289c40d8d786f12d7f32e8d428b0e4
ocamlgraph_1.8.8-1.1build1.dsc 2.2 KiB 0f7e40a251d42d1cfb4ccefcb6b74dd5cdad572b9441afc29cc6c0f5c1c03ac4

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: debug symbols for libocamlgraph-ocaml-dev
libocamlgraph-ocaml-doc: No summary available for libocamlgraph-ocaml-doc in ubuntu hirsute.

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