Result for F1341ED6D70200091982A6C0A5256615283D1D34

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.armel.gz
FileSize228
MD564B2079403B62BEEBCCA30312C863A0E
SHA-1F1341ED6D70200091982A6C0A5256615283D1D34
SHA-256AD267A9E283312558A21A93832A46B95020B0900F603B819C79A4D81B3199C1B
SSDEEP6:XtBaF6QqdJlEflSV8P4YQf0+hh8tjR06PYiRLzBoo3n:X+kPdJmxPFQlSZXBl
TLSHT1E1D097AC04810001799AD0B390BF081A8D2C62AA20B8816E4509271800C6C882CA8CC8
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
FileSize1209290
MD52A660CC872803060F63F680FA29DAB60
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-1621DCDB777D31903D7B0C052A06BCFE20D22E5C4
SHA-256D053B7859B4227913F33C38C8E41AC54F5CDC73DD8F33B967AC3AC4897C5911C
Key Value
FileSize4057626
MD507A13749BEAB3B86E5D1CC8EB5453016
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-144DA0FDD246114D55BB743137196E9FFA1032A5F
SHA-2569817D6F48D0E7E0BC2685C40C7455DE5889CB8B7E54261C0950D41735B798639
Key Value
FileSize200476
MD52C8D9E8961543776C36CDA9BCD99021F
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-177E3113B4FED8CC980B62E75997F085E39110ED7
SHA-2568D6A182EA106186B75F406C8B78AC625BB57CEA0331AE3AFAD57EB66D6640240