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
MD5	D80435B60239A9CFEDB6CDA1E39A7D18
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.fc21
PackageVersion	1.8.5
SHA-1	19DE89CDB46318AD5FFB9118C056FCDCB87A31B0
SHA-256	2FCC59C62261E55076936FCB50468E03E3F9FB8645F15BC4C540287D7473B33D

Key	Value
MD5	F56C750E1A0BB2F5648F9B58B48958B5
PackageArch	ppc64le
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.fc21
PackageVersion	1.8.5
SHA-1	D26DB7BD95AA5A38FCAA10A7F772F3C1A086237A
SHA-256	F31299592EB3EA55DC64C57A9042B49A4C2F7582344F4C64094974748D476349

Key	Value
MD5	1841BCB60C803C01F014342A75B3CD98
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc21
PackageVersion	1.8.5
SHA-1	651084D7F1706536446430B2EEA5709D81B20A60
SHA-256	7D59FDD94118860C23C120C94835B334399BC3D10EDE27D73CFB818C2A7DCF7E