Parents (Total: 7)

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

Key	Value
MD5	CEBBE07E1D819DF622EC15985BA9C79E
PackageArch	ppc
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc20
PackageVersion	1.8.3
SHA-1	6A9D19813D164A01508FE70714B8E3E20F660DAD
SHA-256	DBFDB8878F3E0A22CF1A3C6B9C6CEB8F5E197AA998D5A6BECAB62D4115E984A9

Key	Value
MD5	F1C1A596490A9A4E07FF1D1823A0AD3A
PackageArch	ppc64
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	1.fc19
PackageVersion	1.8.3
SHA-1	435A8E4F2A25362515744DF1E223E3B6A6551469
SHA-256	8634035E21061C0E97865A561755EF9E0BDC33A82C83D2D2B17A3BDFB50D8223

Key	Value
MD5	040E7C96463FDE6A57817FAB2E40604A
PackageArch	ppc64
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc20
PackageVersion	1.8.3
SHA-1	B7D44F2BABEB56B156F9E6EAEBFDF0AF820A4174
SHA-256	A672BA3ADCB0631CD856FD0CBA04ADCD7DBE2E045D4CBCFCE1AAAA6C45E285C4

Key	Value
FileSize	1047734
MD5	6DD759ECD1DE231082DE6F93A71456B4
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.3-1build1
SHA-1	C68D71FB57E688AF9EEBD9F43365D1490A786EA7
SHA-256	0348BB8BA80BF5F44F606763BED8517D094D70610C230614693CB5578C773F68

Key	Value
FileSize	1047916
MD5	476BB45C2EF15FA3917F873BD1552AA1
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	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.3-1build1
SHA-1	195FD4AB46F305601E30A441BCDEC1E277F4D7F2
SHA-256	C62450FF4331132E034AF128A2B81420DAF86B0039EAC79C7F6FFD9E3EF41076

Key	Value
MD5	0AFC09D12F829BCC3173C397E1D431E8
PackageArch	ppc
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	1.fc19
PackageVersion	1.8.3
SHA-1	A002C14D05103FB443ECA38C893C307A941663AD
SHA-256	1954709A7AC8512FA67248464F50DF5899EFDD22E9A85F69E5573E2725DF3CB8

Key	Value
MD5	E4EC98E98EEAF85404836CE33858D749
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	1.fc19
PackageVersion	1.8.3
SHA-1	307BE174B85459A542A779E82F6D9A37847570D1
SHA-256	806C2C86FCCBC9FE9E5B49831DC00C1E2EA2F70C7F578D3F1F516D32993D233E