Result for 340AFF6091D145FE6B342E339DDD718E3EA0F572

Query result

Key Value
FileName./usr/lib/ocaml/ocamlgraph/viewgraph.cmo
FileSize22333
MD52EF65BBBB96AE3830B8022770885CA8A
SHA-1340AFF6091D145FE6B342E339DDD718E3EA0F572
SHA-256CC103F8AE21A8C7B9A5C716803BD0473C4A78C94EFB5534858102651EA5B1D0C
SSDEEP384:7DssssEtY74ycX+pv+54qRdkVtSuEPS6zL9A/:Vt3hgP5A/
TLSHT197A2F04A67014FA1D1FA0BB2C8D793852365D661AB97071E209C977C29C3FEFAB443E4
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
FileSize183910
MD5740181BB40B5007B7B7CF392330ACDDD
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.3-1build1
SHA-1F4278CB21CC219B2957C8B4C00249774A4895921
SHA-2567E7C81BEFE56C3C2EF8524172D81867D5802407E522931BD71A9DCC7649E283E
Key Value
FileSize184678
MD523F4F52E1E51C5A2A336B0CA70B37004
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.3-1build1
SHA-13C138C8C259288B835AC0E0B80D9CECD1FDFCAF4
SHA-256BC9089993B735051997505C017FD1723AC701D64B1E3A957D12D4F6E2C5E3B94