Result for A7C650D0197AC0260605A1A5F90C8957899F4A7D

Query result

Key Value
FileName./usr/lib/ocaml/ocamlgraph/dgraph.cmi
FileSize192298
MD5ECD31E78707A0F90DCF4C830249C0B4C
SHA-1A7C650D0197AC0260605A1A5F90C8957899F4A7D
SHA-2568D09D3414F121F94289E79A3C7B9BBF8A90978E02A301F273CC9E3AA9BA3C051
SSDEEP3072:fygeWUf0wA91BMad56KVOpYJnZ/YEFtyX7AJ/2VBjAVSztidJGTQbPJHfNpT8+l:fygezswA93Mk5JVkolYE/yX7AJ/2TjAL
TLSHT13714920DA9B5F8B5018E886DC457EEB762848B3F9D374C73204A57E6A6ED40E870E4D3
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
FileSize184532
MD552354D75E5C4935440E406A3E4D6562C
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-1build5
SHA-125CDF3EE6A1B56A946DC837185D70DF84E7E23E6
SHA-256BD4F64549D02A30A4B498AACD964436DB70BCE02B7CFE17252B11AB66C00F9AB
Key Value
FileSize184872
MD53B671FA3C5238F86FB3532E62A3AB7C0
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-1build5
SHA-1109C45D3FBDFB3686A9EA819B97922946369DB66
SHA-2567F0326B48853C88F3246BCF31DB9AB319E3B3A0954C5A55B0AB39BE56562C8F0