Result for C77A0A2C1EC37C6E0860D5CEF1D5787C17622157

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.mips.gz
FileSize228
MD57E8CF53BB04990347DB63A160FB27A90
SHA-1C77A0A2C1EC37C6E0860D5CEF1D5787C17622157
SHA-256D807A569150D2C48374C72CD7BD46B6BBC2CE6A89E279A9D7354DE0746345019
SSDEEP6:Xt5aWznfppdMoN6DSUfDUo5DVvKcnfQofeWn4aE:X+W7fGC6to0DFHnpfeUHE
TLSHT1CAD0234F29F004CECC7D3CB8548103CC240E0D84BA20784F00200CC7440A5B8D0A03FD
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
FileSize894674
MD5F02AD5473D6FB290D8183C73F47029BB
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-188043FC7DE3FF1E2093FCF257D2F218E3F8E709E
SHA-256CAC2D271A5239EBBECB357672F71F125DABA715D2F80725D3336FE5DDEF697CA
Key Value
FileSize1479814
MD54751F9D98EED831B74B3316E9E6ED0C5
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-17F703E84F734D8C375B2FB46368D8EB9DFFCDC25
SHA-25655B091B9437C1DC170040F0A4B2F1F3602592E74C5DA75D9438EE1EECA6BC5D9
Key Value
FileSize92684
MD5F690198E169F71DF88C445B8ACD03DA2
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-1DD367A44841449BF90A370C74FCE9C04D690CDAE
SHA-25662CEB8545253680F27FC3F753783DE1301C73E5A33C00C55F98FA95892965846