ocamlgraph 1.7-1build2 source package in Ubuntu

Changelog

ocamlgraph (1.7-1build2) oneiric; urgency=low

  * No-change rebuild for new lablgtk2 ABI
 -- Iain Lane <email address hidden>   Fri, 23 Sep 2011 13:22:34 +0100

Upload details

Uploaded by:
Iain Lane
Uploaded to:
Oneiric
Original maintainer:
Debian OCaml Maintainers
Architectures:
any
Section:
libdevel
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
ocamlgraph_1.7.orig.tar.gz 225.7 KiB 0b69cac203be67c758c9b075fcc1f38119ecacd4d481795da023ec74b86495f2
ocamlgraph_1.7-1build2.diff.gz 11.7 KiB b88ae3d0d63473e23df38c94e7ad0fa35d0bff80c1c220cc58b1d2e5e119a431
ocamlgraph_1.7-1build2.dsc 2.2 KiB 7257c670ab13a660f6c4818ccfadf1a4208245c851076f34b5683aa72fb887b8

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

 This package provides the API reference documentation generated by
 ocamldoc.

libocamlgraph-viewer-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.
 .
 This package provides viewgraph and dgraph library to build graph
 viewers.

ocamlgraph-editor: No summary available for ocamlgraph-editor in ubuntu oneiric.

No description available for ocamlgraph-editor in ubuntu oneiric.