Result for 8DD378965E7C4581F956FEBF92285F76B6E2AF5E

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.amd64.gz
FileSize236
MD54BE96AF6245C5603D355AB8F3108F215
SHA-18DD378965E7C4581F956FEBF92285F76B6E2AF5E
SHA-2569DF4326D700CE4D38A5639E2497CAD4DB65E5A6CED4A2FC0FD3B8EAE7787343E
SSDEEP6:XtNyV56D1w6gEvgUhA3089hpEcOqgSi1ogiUrvx6EtwQ:XuU1w6geg/B9vPtVlgiUrZ6EtwQ
TLSHT109D0977C013DA03CF3084630579D20B785CFBF01486A6A30136E03970062A4B13A4E84
hashlookup:parent-total3
hashlookup:trust65

Network graph view

Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize4201450
MD55C1D1522A8DFFA347214C4F7B21AC923
PackageDescriptiongraphical graph editor based on hyperbolic geometry Ocamlgraph editor is an interactive graph editor for GNOME; it is based on hyperbolic geometry (it "zooms" more on graph nodes which are in the center of the editing area and zooms less on periferic nodes). . Ocamlgraph editor works with the following file formats to load and save graphs: GML (Graph Modelling Language), DOT (the file format used by Graphviz). . Ocamlgraph is still to be considered experimental.
PackageMaintainerDebian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageNameocamlgraph-editor
PackageSectiongraphics
PackageVersion1.8.6-1+b2
SHA-1A66BB100673902649ECDB4CB694EE3AD7E6DF173
SHA-256BB1DC2394F6FDE01ED35F2744D3C2321D59771094BC61F545821F10E7C04811F
Key Value
FileSize1300674
MD50DB296A8D3BC0AC59B26B4E8DBDA2938
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.
PackageMaintainerDebian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageNamelibocamlgraph-ocaml-dev
PackageSectionocaml
PackageVersion1.8.6-1+b2
SHA-14B799C476E3CA1893C9840154223095238E8A228
SHA-256C90711E7EFDB4C79D4F32EBB8DBCE2722B7EC401DDC1562BA4491B275B630DF1
Key Value
FileSize184696
MD59DF5DB010A404AEDAB26AA25A3E69F2D
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+b2
SHA-18D962433DBF09973017AD2C074294527505EC713
SHA-2569A7A79069C8D45D02A4CF3327F99C90ECC143A8BE9DD109FD77E255AE773A6B1