Result for 67AC9B7C635CB7A26B63908E092AC55CB519ABE6

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.armhf.gz
FileSize227
MD5D1A3BEB55B80EB0A56454802471A6251
SHA-167AC9B7C635CB7A26B63908E092AC55CB519ABE6
SHA-256729173EA986504126AFE431A75932D7B47EBE855197A6EF33DD74469A0688187
SSDEEP6:XtBmO+iL2pYark/9zdZ57qC0VYqtiIbjLXtF0A0rzL7K+UIPn:XJ+iLBdjOC0Sqt1bHXtF50r/7K+UI
TLSHT1A1D0236EB241E24BC307047840F5728B9226073870F0AC43D01A47E24B0C53505E0E3C
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
FileSize209306
MD5B79055DE506CB9BC773ADBD7812AB5B8
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-12F25B033AF48BEE3DE2B28CFD19F64B18DD1AB41
SHA-2561526B6E72C7E41ACC58BC0657FA2C6FB4B3E2D8C8CCDB0B7388D1EEA321EB1D3
Key Value
FileSize3182884
MD5BF714A576FDB9BECE9E93CBA7C8E1BDF
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-188CAFFF008633B4A311C5643400B9947EEF42FC6
SHA-2561239DA707476C57C172A8711A53DCDC1FDFC7F727EF95F2E151C6FADA004E003
Key Value
FileSize1243014
MD5E99BDC73280E2F2C5CCD0784E6DE3237
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-17CA48203CEEA7830FB3094CFE16463D858E8C094
SHA-256D641C8B3549D87884071190CCAAF0A3834226432683A61B59D949AA8E72CC8A2