Result for 394B4162F3318DF9A23F70055AE284F4FB69903E

Query result

Key Value
FileName./var/lib/ocaml/md5sums/libocamlgraph-viewer-ocaml-dev.md5sums
FileSize183
MD5313EE7785344FBD1788845E31B3DE03F
SHA-1394B4162F3318DF9A23F70055AE284F4FB69903E
SHA-256BE0C59E5484686AF91CFCECCA588853A031667609E9C0996420191B688B03FF9
SSDEEP3:aRiPi0WghMyHdE0KTMA7w8ASEQzX0DBUa+BiAD7c1FSCMyHdE0KTMA7w8ASEQ8:a0q0dJdCTBk8R3qUa+iKAfMUdCTBk8Rg
TLSHT1D4C0807453C6D1E83A4CC43C402250873EDFD8685DD3806AC0D313509435A5EF370400
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
FileSize92706
MD549E2D678A950419F98CF28836C289001
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.
PackageMaintainerDebian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageNamelibocamlgraph-viewer-ocaml-dev
PackageSectionocaml
PackageVersion1.8.6-1+b3
SHA-1C5C2B189FE890491E512B1116EEA8FE29F4347B2
SHA-25605EB6B10BFD033933050903ADA44466A0876C224D3DF96FD716C953A12C3EDD6
Key Value
FileSize92706
MD54529E2268BBB0DF85FF3E5915BC07ACE
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.
PackageMaintainerDebian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageNamelibocamlgraph-viewer-ocaml-dev
PackageSectionocaml
PackageVersion1.8.6-1+b3
SHA-186F65484F63A8390BAA5CAF6918C0190FD80CDFA
SHA-256D3F607CF0EBA9071B30CB6B4FEDE459B4AFB04FFA91C837E3056252D0A5670F0