ocamlgraph 2.0.0-3build1 source package in Ubuntu
Changelog
ocamlgraph (2.0.0-3build1) jammy; urgency=medium * No-change rebuild for ocaml abi changes. -- Matthias Klose <email address hidden> Wed, 26 Jan 2022 01:07:18 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Jammy
- Original maintainer:
- Debian OCaml Maintainers
- Architectures:
- any all
- Section:
- libdevel
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Lunar | release | universe | libdevel | |
| Jammy | release | universe | libdevel |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| ocamlgraph_2.0.0.orig.tar.gz | 351.8 KiB | aa9bd7c40489039f0e35941cd61da3ab8ab7e1f83a34e14083b6040a5e2cf6d4 |
| ocamlgraph_2.0.0-3build1.debian.tar.xz | 12.1 KiB | f7e09ef5f9b9e2174e53424cdcd11236e017b2dc65800a01cb438a834812fc9a |
| ocamlgraph_2.0.0-3build1.dsc | 2.2 KiB | fba7051c0e0b9aa7d4f056a23a7c80cd0eaf318c20a886e5da2a18d63d92abcc |
Available diffs
- diff from 1.8.8-1.1build2 to 2.0.0-3build1 (233.1 KiB)
- diff from 2.0.0-3 (in Debian) to 2.0.0-3build1 (307 bytes)
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 kinetic.
No description available for libocamlgraph-
ocaml-dev- dbgsym in ubuntu kinetic.
- libocamlgraph-ocaml-doc: documentation for the OCamlgraph library
This package provides the API reference documentation generated by
ocamldoc.
