Parents (Total: 4)

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

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
MD5	B1484C5F0E7DB80E56EE5512960FC69C
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	3.mga7
PackageVersion	1.8.8
SHA-1	BFE5A8C5EE3BF25A3FE99491D3ED87F42325196E
SHA-256	A156B5699FB12144A4AA090718E87579C0B16E6F48A418D04DF98D0C8197ECBC

Key	Value
MD5	614CD0FEA232C420DB6E2F530F98C375
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	3.mga7
PackageVersion	1.8.8
SHA-1	FF9551768E519267B612E515D47C67E194FFF321
SHA-256	2C7260E9719A41386F03083213C01AAFB3602377686F6606015683E2B8BE101C

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