Parents (Total: 14)

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

Key	Value
MD5	CD5165A52BFF6D83BF99EB0142370CF7
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	23.fc33.1
PackageVersion	1.8.8
SHA-1	8DBDAC61C30D3FF2DF93A23A4EEFEC4085040024
SHA-256	8C9A0B2DE080D3E615CA9A3BB6BD180D501EC7F51B23EA98D12863384150962F

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	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	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	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

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	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	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	EC8113EA136C7A85A1862093DF0BE26B
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	24.fc34
PackageVersion	1.8.8
SHA-1	A3F7CE7889B0A386B4A874CDEC8BDF5E24B24E36
SHA-256	7711508C8D6F3333CBC82524E515162F49071BE0059B06884E1FF260C676CA4D

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	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	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	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