Parents (Total: 8)

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

Key	Value
MD5	E74557858C292C6446DE70E7521C590C
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	15.fc32.1
PackageVersion	1.8.8
SHA-1	23FCEBA0CC660053EC823C1A8080B2C753568A2B
SHA-256	EC4A070F2D85E092A08946F519968EA9D97B9E1D4EA15C72D179B4C8F841110A

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	2EC1A6F863677741A7CA2FE460936943
PackageArch	i586
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	E4C8D6D2EC7881A47BBE76633C5EC39390F7A2E1
SHA-256	65BF70DE7ACD5E6C90B0262ED3E9434DB169D08D83FF66E62B60EBD1336CA408

Key	Value
MD5	3F93016D2F868FA049847E37B907633A
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	15.fc32.1
PackageVersion	1.8.8
SHA-1	44626B828B1674AE1FC2A89E86E506CBF28AD6BE
SHA-256	E6A6FA1AF29C03AE6C9BE4797DBD4A5223DF7C1B30CE08B297249CC8B7922ADA

Key	Value
MD5	5B739E46051EC8ABC574D280AFE4E2C9
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	7.mga8
PackageVersion	1.8.8
SHA-1	E921BA68FE669801A26B844C425F52969BD780FB
SHA-256	B15C588754D00F7527A31D0168D26FB0162A2B921344FF710E62C5F080615D47

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	12F3F5F5864E1F394CC1149791B011D7
PackageArch	i686
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	15.fc32.1
PackageVersion	1.8.8
SHA-1	5C11198E13CB4B9AF81C8B4E39274150833568C1
SHA-256	93B59BFC42B796E652C49C71504D20E4FDDB8231A9C95A90DA364B6C2D12376E

Key	Value
MD5	A9ABB9F60469051331BCD53AE1E62717
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	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	15.fc32.1
PackageVersion	1.8.8
SHA-1	014736414F93182EDFA5AC9744CA07084E3D3667
SHA-256	0FDFE2AF57D0101DA8FA32A52BF2DEBE051AD7AC0DC2D9A1419936FFBF662537