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	7FDB2E49908AE58A11FA25DB42192274
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	4.mga9
PackageVersion	2.0.0
SHA-1	E54667D6F3D9F12E1102F483BCDE98E01081AC18
SHA-256	57B1E4B816EA9C85E35471EE7E7C08E5A021DE206B448242938C556B8380C723

Key	Value
MD5	66AE444F6FED503022FF270439A50854
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	4.mga9
PackageVersion	2.0.0
SHA-1	BA3C243647749AC33B460BE61DD4965108F37EA2
SHA-256	D96E0D42A36C3CAD4B263E31BD03690B9F46FB51B4A805F5C58AF9D405F0438F

Key	Value
MD5	C99AE0DCEC56389443ADA8BDFF326E09
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.mga9
PackageVersion	2.0.0
SHA-1	CED7A201DAFB21B728AFC75398C1949433E04BF9
SHA-256	545F3A35762A8E2AE0FE188EDD444D34FAEF929E6AC2641204AB9AC03EF1A763

Key	Value
MD5	9A2AD4D4E99186885FE921C0BA69B3A9
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	4.mga9
PackageVersion	2.0.0
SHA-1	9E47E46F39423E8622D54F60835A4B6C54F8C508
SHA-256	D5B4DBFB013AD54F72C19CDA5C83812CAF66432FED3F3B9F0004F41734D69CF6

Key	Value
MD5	0A29EB04998E0A9A9C184F910E740C2C
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.mga9
PackageVersion	2.0.0
SHA-1	FCB934D5C130C3920D20ED9C6F2F43849F57EB5B
SHA-256	037C176A2DE626E46CA7D478FFE74B7B92E07AD77D1D028E4322EDB234D6524B

Key	Value
MD5	6AA706804A0A5928A5FEF26B04BD3C0F
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.mga9
PackageVersion	2.0.0
SHA-1	EC53EB486AC548A6CD9BD0F0DCA5DDAA1982FB17
SHA-256	B208E776A690A0505A38E83D7B79ED270A727D8628D36BF0CE52F43AEFFB9777

Key	Value
MD5	416FCDDDF7BC4D2379F894E289F15AB3
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.mga9
PackageVersion	2.0.0
SHA-1	F482FC15818D8369DC5E804C588B610B02E6F421
SHA-256	9604789B77221ED1FE44C56982D6BBB1A7383297146C76CD0BCF50085862BD09

Key	Value
MD5	A4D31B1C6F271F4E0ECEE6BFD79F0E77
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	4.mga9
PackageVersion	2.0.0
SHA-1	0C6D88F49D5A268CEC58946B3FC0590BBEE5D3FE
SHA-256	52FBEA47894186EAD43AD6C06FA5162158DA5F6C423CE2A62F5A99FBC15A8C82