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	1047734
MD5	6DD759ECD1DE231082DE6F93A71456B4
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.3-1build1
SHA-1	C68D71FB57E688AF9EEBD9F43365D1490A786EA7
SHA-256	0348BB8BA80BF5F44F606763BED8517D094D70610C230614693CB5578C773F68

Key	Value
FileSize	1047916
MD5	476BB45C2EF15FA3917F873BD1552AA1
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.3-1build1
SHA-1	195FD4AB46F305601E30A441BCDEC1E277F4D7F2
SHA-256	C62450FF4331132E034AF128A2B81420DAF86B0039EAC79C7F6FFD9E3EF41076