Parents (Total: 28)

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

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

Key	Value
MD5	10D13E51F0F3BF16C1A97E254FD9CBC7
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.fc23
PackageVersion	1.8.6
SHA-1	1681F819860DE1FDA6BA9CA4E9F3F9DE832899BB
SHA-256	8398BDD8F22ECE0F80A1B643B32BDC1F39C7716D80ECC5BDC2F9C8C5F1306D73

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	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	E4EC98E98EEAF85404836CE33858D749
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	1.fc19
PackageVersion	1.8.3
SHA-1	307BE174B85459A542A779E82F6D9A37847570D1
SHA-256	806C2C86FCCBC9FE9E5B49831DC00C1E2EA2F70C7F578D3F1F516D32993D233E

Key	Value
MD5	F1C1A596490A9A4E07FF1D1823A0AD3A
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.fc19
PackageVersion	1.8.3
SHA-1	435A8E4F2A25362515744DF1E223E3B6A6551469
SHA-256	8634035E21061C0E97865A561755EF9E0BDC33A82C83D2D2B17A3BDFB50D8223

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	3662C38B5FB76722832F638FD1886AD0
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	24.fc34
PackageVersion	1.8.8
SHA-1	521AF5C5F4523DA4B8AEF22400BC24B0D14DE2AF
SHA-256	63EA37F1FF247522C9AEE8304D2B8E48ACF9F291B30BF4608E51B990156D3EAE

Key	Value
MD5	833490B4652C7C01FDE2585D3BA72459
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	23.fc33.1
PackageVersion	1.8.8
SHA-1	56BA8C9CA123A1537257BB1E3A92CC5211CECB1A
SHA-256	5CC14DB89CC98BB7C1544BA41C635C0A66E6CF7E7F0C0334300EA254238DFBB5

Key	Value
MD5	5780352DE868490E67C6F745FEBBA823
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.fc23
PackageVersion	1.8.6
SHA-1	585EAD9C43C8BDA0B1C36DF1323F00B74003774A
SHA-256	94B5999145F4345EE087D737EC7693868FC072ED8CFDD755F8D0E1896249A4A9