Result for 4E67954C44242A07D25243440E74807739EB456A

Query result

Key Value
FileName./usr/share/doc/libocamlgraph-viewer-ocaml-dev/changelog.Debian.gz
FileSize1014
MD5B091E1A6D84C4679697187DC024EA576
SHA-14E67954C44242A07D25243440E74807739EB456A
SHA-256E6620001FA05300D4FA7DFFB2CDDB78259A8888DEB96DEFF751B6B73234214B6
SSDEEP24:XFk76S4vkkDpNa/D+tJuIs/GbdvS3URbzu9kRZTHi:XF46zskD3ztJts/GBlzuyRxi
TLSHT10A11D8069AB56046ED728BB4FB3C2D450B4268492D58512109065E253A073079233993
hashlookup:parent-total2
hashlookup:trust60

Network graph view

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
FileSize175254
MD5C8B7AFB720ED8B592C6EF1F0E0E28B51
PackageDescriptiongraph 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibocamlgraph-viewer-ocaml-dev
PackageSectionocaml
PackageVersion1.8.6-1build2
SHA-1B57AF920E9B69C02A03762DC709727C8F4835D84
SHA-25622206FCF7717DAA6ABED04FA09AECFF1DADEAB51CD792266CF593804D0F6DE9B
Key Value
FileSize176164
MD5691C65E792129C24DA31367FF00FAAC4
PackageDescriptiongraph 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibocamlgraph-viewer-ocaml-dev
PackageSectionocaml
PackageVersion1.8.6-1build2
SHA-10ACED5B4A5F7B218FBDFE7D98041346E94601283
SHA-25697F7FA7CB31A031952321ACDFE953A40EEA36AF82DB8D182ABC7DD88C18FB84F