Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	4519936
MD5	AA9DEF534CF1E36E6B1D454A2EDB6272
PackageDescription	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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	2.0.0-2
SHA-1	A729D3C5BEC5CFABBACDD054CAB8A43F044FAE45
SHA-256	45AB57CDDCB3825B816E134B983EBCDE26F507C0554D53ADCDA8455F7609A70C

Key	Value
FileSize	4496808
MD5	19431D84ECB117C59D4E4B1F4DC127A2
PackageDescription	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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	2.0.0-2
SHA-1	18E50B31E2B1A92959050A3E66880CE08259E386
SHA-256	16CF6F34E2358CF4770386D6D4A2AEF8C10189C0BC1B8F78ADEE56EC94BB5CDA

Key	Value
FileSize	4553636
MD5	DC0659ACC64C15F720A059EB9338C0CE
PackageDescription	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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	2.0.0-2
SHA-1	4D27EE11C3B232C2DE34485E4DEA37BBEDD52401
SHA-256	C5F799D1376916CF49538FCB2C286A61F6D656E3698569FD42DD1C2754A690B9