Parents (Total: 47)

The searched file hash is included in 47 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
MD5	6AA44A65918E831C6A03D6B7A6FF3D69
PackageArch	x86_64
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	pterjan <pterjan>
PackageName	ocaml-ocamlgraph
PackageRelease	7.mga8
PackageVersion	1.8.8
SHA-1	06BAA5D9D59E622CA63A39C5BF081532F7A7E364
SHA-256	45C883ECC4D2ABC760F52197F2697D9169B9F484C79286C42BAF8666D3E00662

Key	Value
MD5	6EA4A3EED0DF09EAE72C598E9DA903F0
PackageArch	armv7hl
PackageDescription	The ocaml-ocamlgraph-devel package contains libraries and signature files for developing applications that use ocaml-ocamlgraph.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph-devel
PackageRelease	24.fc34
PackageVersion	1.8.8
SHA-1	1468A7FB76B80A1477251506730CE21180E79C40
SHA-256	20C9C9290D191E5ABFE873D4F779A763CED05B42289A6F46E8ADE697E45DABEA

Key	Value
MD5	0893BAE663289CA84F348DC6A364FCD3
PackageArch	armv7hl
PackageDescription	The ocaml-ocamlgraph-devel package contains libraries and signature files for developing applications that use ocaml-ocamlgraph.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph-devel
PackageRelease	23.fc33.1
PackageVersion	1.8.8
SHA-1	14913641772FFF1B950BB768DD3E9ADF3070AB0C
SHA-256	AC727F84F780523F1E147573AF6BE2D151B26B9A8DBF7A4155F55B3FAA9B60E6

Key	Value
MD5	F5B08D0396A41378DFDF0ADADC51F1B9
PackageArch	armv7hl
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	pterjan <pterjan>
PackageName	ocaml-ocamlgraph
PackageRelease	7.mga8
PackageVersion	1.8.8
SHA-1	14B6AAF27E7B151FDF8FF9FBAD63CB7267F9DC64
SHA-256	0047DD4EA8960144C601AD803AC429CF00C69B5D886BE1E6AADCDC2095C1E1B3

Key	Value
MD5	4DF10DBA1E5FDE92EA09399931A2BAC9
PackageArch	armv7hl
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	pterjan <pterjan>
PackageName	ocaml-ocamlgraph
PackageRelease	3.mga7
PackageVersion	1.8.8
SHA-1	1D213C16124C756ADEC6530B1243C239E8B462D5
SHA-256	402460023754169E341BD7B281FD12E423E8D27B5E3A615810529F7E631F1EF4

Key	Value
FileSize	1598808
MD5	4806B3F5DED3B9B0AC5B59CCEF4ADFB6
PackageDescription	graph 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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.8-1.1
SHA-1	22193E716473801523AC77EBF9B4CE92C3B9884B
SHA-256	523167C6AEECD3990B272E0A204DEA22FD1F1F86FE39B13142CFF9511B122872

Key	Value
MD5	28F56C4FA482098F631F95AAFE4F386C
PackageArch	i686
PackageDescription	The ocaml-ocamlgraph-devel package contains libraries and signature files for developing applications that use ocaml-ocamlgraph.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph-devel
PackageRelease	24.fc34
PackageVersion	1.8.8
SHA-1	3FA728D8283862B78B2C49FAB26EACC5B1E71FF3
SHA-256	E3F277FB06F3FECC58877D3668840B173D36513377B46974D2BCF9E724965833

Key	Value
FileSize	1745256
MD5	2DEAD725890659BF032C7996A2C62330
PackageDescription	graph 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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.8-1.1+b2
SHA-1	41DE26C915C07B7B85CF178147684920EAC3BE8B
SHA-256	79B84724E3F612023FBFE506B8BE9A39704E9796F30A076ED71E65BAB85428D8

Key	Value
MD5	1AFD41D380820D2BE875EAEE89E30F90
PackageArch	aarch64
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	pterjan <pterjan>
PackageName	ocaml-ocamlgraph
PackageRelease	3.mga7
PackageVersion	1.8.8
SHA-1	4327D7545BE8A92FD46819588DC9EA789607A18E
SHA-256	B6A41EF7588B6A85F5DEDEEA04735084C7A8F0A411B2CF09CFF7E0E174682E14

Key	Value
FileSize	1506792
MD5	CD1AE76BE1C7450F7F797FA17FECFB0F
PackageDescription	graph 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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.8-1.1
SHA-1	43C5BA3A0EECF315E4AAE97E2EB27201516BA142
SHA-256	86CCBE5E688B40F86E4B13837EEB84E19CBBD9C34BD489F87034DA2F42CC0358