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	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	B0C0B7C71916F44B23CA6D7D90EE8AA4
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	24.fc34
PackageVersion	1.8.8
SHA-1	BABAEAF56C71D5577620A56FAA79E2F91E214F03
SHA-256	8D1D21023445A0DB7653169DBE50E3DFA3BD28704A125C49DBBFB1BC4BA15FF9

Key	Value
MD5	3A1F8851F448EFA9582E881A88AAC44D
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	23.fc33.1
PackageVersion	1.8.8
SHA-1	73371E395AEA65EA2F58F0470E44BA51E12D4893
SHA-256	F47271ADD25D38271DCCACFB4B49A2F282587B4C11CE49C67C808D4ACF340CDF

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	0826C8A91FB32F60380DD616899B232A
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	24.fc34
PackageVersion	1.8.8
SHA-1	8B3CF02CCC4AE8A1857C06C35BE6DF9798E9372F
SHA-256	69BEE481986A40A05EF7287BCDE968B7CFC3F7C7F591B062C2E28E2A95126CE7

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	2DBA9EEED133D46165BE2F31B389ADBF
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	23.fc33.1
PackageVersion	1.8.8
SHA-1	BD173D269B2A36BEA436267321701A60883F8C8A
SHA-256	B7EDF9F9125484C3B2494066F472994BCB4B16E8A0CA146055B3F58891C1D0F5