Result for F0BB67542A761E3863A9452DCB4B8961D45B0CC0

Query result

Key Value
FileName./usr/share/doc/ocamlgraph-editor/changelog.Debian.i386.gz
FileSize238
MD5FCEC8217809EEF21A007C40B1ECE4590
SHA-1F0BB67542A761E3863A9452DCB4B8961D45B0CC0
SHA-256274D70C6EC5E7DAB329B7385ACE6B904ACD0DC4825AB3273036ACBDDE5017E39
SSDEEP6:Xt9PBGLpWjAHRhneqfJ81arb7bbQBOnC56hqIyxRO:X/5GZhnQ0b1C5VRO
TLSHT164D097505A0080F08C1A0A22F01A03898217139DEE442AF301C797CCD5E9632419430F
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
FileSize185228
MD503125ECE16F0AA2F9258A91826BDEB4F
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-1FBEA4B046F4C3C1AF6D11239ED02604C6435611B
SHA-256037B587C712448D40EE831DF882C2D18C4E44B38FAB2B78497ACF997F88DF4D9
Key Value
FileSize4069504
MD526D6C09345EC14FFC54E7EBF05AD596F
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-169FB7FF713235EAEF424BEC2567FC5B97B1CF7D8
SHA-256BB53711DED2B398BAED98922AF50D97D76E2473181DD7C786FD2F540870BC29E
Key Value
FileSize1184050
MD5B6E5B00BCC0B56B0B6469F3789D45B71
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-1599E71375DDA42BCA1274F02079F0E0D8810C47F
SHA-256DD851EEB1F188C762B72B89F1587EF44A3C2FD04FD547237C55E613BB724E967