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	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	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	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	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	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	5B739E46051EC8ABC574D280AFE4E2C9
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	7.mga8
PackageVersion	1.8.8
SHA-1	E921BA68FE669801A26B844C425F52969BD780FB
SHA-256	B15C588754D00F7527A31D0168D26FB0162A2B921344FF710E62C5F080615D47

Key	Value
MD5	6AA44A65918E831C6A03D6B7A6FF3D69
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	7.mga8
PackageVersion	1.8.8
SHA-1	06BAA5D9D59E622CA63A39C5BF081532F7A7E364
SHA-256	45C883ECC4D2ABC760F52197F2697D9169B9F484C79286C42BAF8666D3E00662

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