Parents (Total: 2)

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

Key	Value
FileSize	4469476
MD5	A50645153D88BD78A6237C937A3F19C7
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	0D8EECDC38459AC897835C58A95762B3F071254F
SHA-256	2E6EB4CA486B6659CC84D734531BB91C13DAD61C4FA1CB5A6B30A92CA21B3E6F

Key	Value
FileSize	4514216
MD5	CC3407EBE11534C756E91FE10558ADB3
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	ED6E710D8BD933A43C363EF50D43BEDE6610D003
SHA-256	76E5FDB6AB01EC25917BB9C7BAE9CD71147DE0CB171DAE20D9C5F501F57744CC