Parents (Total: 46)

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

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	7B2EBC9138144869ED04CA5011E89A70
PackageArch	x86_64
PackageDescription	OCamlgraph is a graph library for Objective Caml.
PackageName	ocaml-ocamlgraph
PackageRelease	16.d_l_ocaml.8
PackageVersion	2.0.0
SHA-1	0A6B133AD591104D58F29552571017F7C4DDDB55
SHA-256	ABA7205F45A730571A8E0E2D1F9866990E1655EE89D461424323CF34AD6FF9BA

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

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	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	F775BBB538DF305A6FC8A1E839EE2FED
PackageArch	armv7hl
PackageDescription	OCamlgraph is a graph library for Objective Caml.
PackageName	ocaml-ocamlgraph
PackageRelease	17.d_l_ocaml.2
PackageVersion	2.0.0
SHA-1	21BAEDBF784CCF1649CEB3E1328130196841AB3E
SHA-256	54A8C3AA0B851DB5BB4929F632EB05B4DB9A8C3889FBD98D5891DEECB92E7AAC

Key	Value
MD5	A651EA11070E7F90323A464F402AD418
PackageArch	x86_64
PackageDescription	OCamlgraph is a graph library for Objective Caml.
PackageName	ocaml-ocamlgraph
PackageRelease	17.d_l_ocaml.2
PackageVersion	2.0.0
SHA-1	2835830022E4D88DA0723A84565294B9D1335D9C
SHA-256	3A4806BBC9160F0091FD75C9B189088B48E480025224F52A957747CA0A10D64D

Key	Value
MD5	03209D54151449EDB0CCB9458F98E2AF
PackageArch	s390x
PackageDescription	OCamlgraph is a graph library for Objective Caml.
PackageMaintainer	https://bugs.opensuse.org
PackageName	ocaml-ocamlgraph
PackageRelease	bp156.1.3
PackageVersion	2.1.0
SHA-1	2BE53F21BD2465488A3A12C4969C325BD8EE0D67
SHA-256	0055E7EF372FF8CF8B3A56676DF0ABA4B6BEA799B212D959FBED4DDAA5769910

Key	Value
MD5	E81B8F8D93C83525CD341795AA4E9443
PackageArch	x86_64
PackageDescription	OCamlgraph is a graph library for Objective Caml.
PackageName	ocaml-ocamlgraph
PackageRelease	17.d_l_ocaml.1
PackageVersion	2.0.0
SHA-1	2F6450759C732EDF2AC8B871F25205EAED4FD742
SHA-256	614869871268FDC64BDA7888899250B7CFC75451B037833414762FD6E9A10A56

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