ocamlgraph 1.8.2-2 source package in Ubuntu

Changelog

ocamlgraph (1.8.2-2) unstable; urgency=low


  * Delete README.source file since its content is outdated.
  * Build manpages during binary-only builds too. This fixes FTBFS on
    autobuilders or when building with "-B".

 -- Mehdi Dogguy <email address hidden>  Tue, 15 May 2012 14:39:46 +0200

Upload details

Uploaded by:
Debian OCaml Maintainers on 2012-05-15
Uploaded to:
Sid
Original maintainer:
Debian OCaml Maintainers
Component:
main
Architectures:
any all
Section:
libdevel
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size MD5 Checksum
ocamlgraph_1.8.2-2.dsc 2.0 KiB 40e665185c28540e737a1972a5d580a7
ocamlgraph_1.8.2.orig.tar.gz 247.1 KiB ef4b11f957bde10a189a1a94298f7a12
ocamlgraph_1.8.2-2.debian.tar.gz 12.4 KiB 7bf4f6900929663de5a617053b17bd49

Available diffs

No changes file available.

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 raring.

No description available for ocamlgraph-editor in ubuntu raring.