Result for D46CAE97C9DDB2B2CBEF0DE3541DEEC61FD47B55

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.mipsel.gz
FileSize242
MD52BA9B61E86060D562E460C8263E7E891
SHA-1D46CAE97C9DDB2B2CBEF0DE3541DEEC61FD47B55
SHA-2564EC26D442DFB5779242FB463ADCAB3DAD4055CBE0A4C6E6805DB3531AAA5CC0D
SSDEEP6:XtrqKliwL/hnl7xTldLg10uu8lxhksLiGS:XJqyiwL/hl7xTrduuE+
TLSHT1A6D0978A737134C1D9380FB56D5A10268BCD0EA01D125DC9276980308BE5F488680047
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
FileSize1477672
MD5981643BA8765ED1A8041027FBB151816
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+b3
SHA-16ACBC04A29158C0C800289C0805CB3287B5820C4
SHA-256B187085971A4A2C375A51CE0AB1AEA90E9C656E7D9B7191B0110B2D94317228F
Key Value
FileSize894602
MD58403E25D10D804C2C737B4D656AC5F20
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+b3
SHA-11C01611755A01DE723F8129D34C5901538C58014
SHA-256233F2E5D6D10A09AC741199BBCA8975F2596054B742539579E47D8385E557B8D
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