Result for 70C2AACABE6833CCC94A2697202A5E7990D40FB3

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.s390x.gz
FileSize231
MD530DEA56959464106088F832707DED486
SHA-170C2AACABE6833CCC94A2697202A5E7990D40FB3
SHA-256B7AB2F30B17AEAF5010431C5E5CBB33EE8D76687B292DAE35BB3402C49657782
SSDEEP6:XtLyoeRu9VpFTqVTUuuSEV8FaVATffGC3Zu9E:XJVwy38VNyjmffG63
TLSHT15FD0A784976E7266F5F00292BF14045C5304021545A7A4809E2F6E84A2AC78ED456C25
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
FileSize92690
MD5C601B586ECEB66EEF42C00D3DAB60CF6
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-1FEF6BD62363AFC0C6D43F61D9B980C387D27438A
SHA-256DD73EF18573DAA7E5AAEB59F4BBA9913F3F6BDC644E2353EB93931CA6B231C57
Key Value
FileSize1479962
MD516D8B26BB47D5EE93BA3E9D19F222717
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-123B7C2EF3AC0807EA240E65551434DEDA10A0C45
SHA-256A349465DDB21913854D925492E0E9E5CD0B4FFABD31A6655AAA01E116CAC712E
Key Value
FileSize894674
MD5F1C09032F66CDABBCEE537B3280D1584
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-194E914FCD093BCB4BC42C3F79F06A793BC285918
SHA-256195251892E75D1ACA6D19A7322288DFFFE83F92055E96999CEC47E7DB5106096