Ubuntu
ocamlgraph package

ocamlgraph 2.1.0-1build1 source package in Ubuntu

Changelog

ocamlgraph (2.1.0-1build1) noble; urgency=medium

  * Rebuild against new OCAML ABI.

 -- Gianfranco Costamagna <email address hidden>  Fri, 03 Nov 2023 17:34:02 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Noble
Original maintainer:
Debian OCaml Maintainers
Architectures:
any all
Section:
libdevel
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Noble release universe libdevel

Downloads

File Size SHA-256 Checksum
ocamlgraph_2.1.0.orig.tar.bz2 308.0 KiB 54893d10209b27ee5523ddc10c289b3db5071263338ac4eff9d56efd4f7d666d
ocamlgraph_2.1.0-1build1.debian.tar.xz 11.8 KiB 3fac4a503240f75d520aef26434c5ed2b5265892ee418dc3026a347489792add
ocamlgraph_2.1.0-1build1.dsc 2.2 KiB 44ee360b738dfc75d5f3c9f08f1edcf17a40549745d2e5f88e4c159eca7cd85f

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: documentation for the OCamlgraph library

 This package provides the API reference documentation generated by
 ocamldoc.