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	9610E144F9F7E74396B34A33D95978A5
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	1.fc22
PackageVersion	1.8.6
SHA-1	CFBC8198149328A59C510D10D86437599DB6674A
SHA-256	E607B1ADB8CB61D8AE10E7FD66D0D62D0E135B1E70F8247779980AAAD0B93597

Key	Value
MD5	F2F10E319B9EABA97D577C3CA4E968D7
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.fc22
PackageVersion	1.8.6
SHA-1	8F09AD13B1EBF29DF9FFCD2EFDE58ED05047E177
SHA-256	82FA46C910FBC324841D33229E7A96E3C7BF3D50CD739ED28B575C04641FFF58

Key	Value
MD5	82B4B5D9FBF771F93872AF1CE202F0C2
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	1.fc22
PackageVersion	1.8.6
SHA-1	CB322E85199430B30CDC8ACEB77959D2A11C56A9
SHA-256	7838375DA7DF637A747E1DAFFBC6DE7BBC2D4E4B8EA63CE2F85ECEACCCB534C6