ocaml-ocamlgraph-2.1.0-1.mga10 RPM for x86_64

From Mageia Cauldron for x86_64 / media / core / release

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.

Provides

• ocaml-ocamlgraph
• ocaml(Graph)
• ocaml(Graph__)
• ocaml(Graph__Bitv)
• ocaml(Graph__Blocks)
• ocaml(Graph__Builder)
• ocaml(Graph__ChaoticIteration)
• ocaml(Graph__Classic)
• ocaml(Graph__Clique)
• ocaml(Graph__Cliquetree)
• ocaml(Graph__Coloring)
• ocaml(Graph__Components)
• ocaml(Graph__Contraction)
• ocaml(Graph__Cycles)
• ocaml(Graph__DGraphModel)
• ocaml(Graph__DGraphRandModel)
• ocaml(Graph__DGraphSubTree)
• ocaml(Graph__DGraphTreeLayout)
• ocaml(Graph__DGraphTreeModel)
• ocaml(Graph__Delaunay)
• ocaml(Graph__Dominator)
• ocaml(Graph__Dot)
• ocaml(Graph__Dot_ast)
• ocaml(Graph__Dot_lexer)
• ocaml(Graph__Dot_parser)
• ocaml(Graph__Eulerian)
• ocaml(Graph__Fixpoint)
• ocaml(Graph__Flow)
• ocaml(Graph__Gmap)
• ocaml(Graph__Gml)
• ocaml(Graph__Graphml)
• ocaml(Graph__Graphviz)
• ocaml(Graph__Heap)
• ocaml(Graph__Imperative)
• ocaml(Graph__Kruskal)
• ocaml(Graph__Leaderlist)
• ocaml(Graph__Mcs_m)
• ocaml(Graph__Md)
• ocaml(Graph__Merge)
• ocaml(Graph__Mincut)
• ocaml(Graph__Minsep)
• ocaml(Graph__Nonnegative)
• ocaml(Graph__Oper)
• ocaml(Graph__Pack)
• ocaml(Graph__Path)
• ocaml(Graph__Persistent)
• ocaml(Graph__PersistentQueue)
• ocaml(Graph__Prim)
• ocaml(Graph__Rand)
• ocaml(Graph__Sig)
• ocaml(Graph__Sig_pack)
• ocaml(Graph__Strat)
• ocaml(Graph__Topological)
• ocaml(Graph__Traverse)
• ocaml(Graph__Unionfind)
• ocaml(Graph__Util)
• ocaml(Graph__WeakTopological)
• ocaml(Graph__XDot)
• ocaml(Graph__XDotDraw)
• ocaml-ocamlgraph(x86-64)

Requires

• ocaml(CamlinternalFormatBasics) = aa550bdab521d60e769a9ad43a677e65
• ocaml(CamlinternalLazy) = e6f402abe3d0b60a19bf6c6c6c6f0848
• ocaml(CamlinternalMod) = 2841d459081b0d0dfe3bde24f9787af1
• ocaml(CamlinternalOO) = 7104364f38cf3c63ed2f3069b6f44253
• ocaml(Graph__) = 26e221ecda044ca22f0caec6a4347125
• ocaml(Graph__Bitv) = 7451ef5340e40432dd130e544c53308c
• ocaml(Graph__Blocks) = 20b4a6a8c8b7ef47c5de2afade918e24
• ocaml(Graph__Builder) = 2ec8c8d364bc7d5f376280be5a3a68aa
• ocaml(Graph__Classic) = 6d84b798360f4a0d83ec42e5f0f43a7d
• ocaml(Graph__Cliquetree) = 2d74b4654423ba51de028c14bf183fd1
• ocaml(Graph__Coloring) = a6b75460fe5e85a388b8afa42406aa14
• ocaml(Graph__Components) = 397c0ba28478d5d3bf271efbc576c745
• ocaml(Graph__DGraphModel) = 12045d91fd815c9fc80b3a8964a77e27
• ocaml(Graph__DGraphSubTree) = a21e42668a8ecae01a74fc1b6c1ff68d
• ocaml(Graph__DGraphTreeLayout) = 8c3eb1066fe2a19a59e1be6b58587ec0
• ocaml(Graph__Delaunay) = 0498e64f9c1c56c7516e70f5ababc836
• ocaml(Graph__Dominator) = 9d45a0cc02d73c622e3f1415ac6a8d55
• ocaml(Graph__Dot) = dd0f01fc36c8643a9b89d1573ca2d9d0
• ocaml(Graph__Dot_ast) = 858d077a0a16377516f84f6c6de79053
• ocaml(Graph__Dot_lexer) = 2fbab5ced0427cc1bd6045b7ba1dbaa7
• ocaml(Graph__Dot_parser) = 979d00616dfcf83702eb397cc0344eae
• ocaml(Graph__Eulerian) = 68097df3fc415d459ab6669e7f9ee272
• ocaml(Graph__Flow) = 38c3de0c3094e5807612d22739027dee
• ocaml(Graph__Gmap) = 68ca354e1eb6cc55f24a98ef72b41ac7
• ocaml(Graph__Gml) = 13e76fbcd45ee4a8200d4314063ef9c5
• ocaml(Graph__Graphviz) = f65a4634c4a3ac6524b1725ddf594bf7
• ocaml(Graph__Heap) = 5b2aa08827dcc6f3c38f2f472a1ab124
• ocaml(Graph__Imperative) = aa20d2be2300ffa3c1a620579b8389f5
• ocaml(Graph__Kruskal) = 3950a7ffaa89743788e6084e26d03705
• ocaml(Graph__Oper) = 2d6c32b80e72746e897fd77db6c32b76
• ocaml(Graph__Path) = a3fe062892f565708166399a6d9a4baf
• ocaml(Graph__Persistent) = b736713f2a06cccfad3a8e1508e1b0b9
• ocaml(Graph__PersistentQueue) = b9cdab85d04a99b2242ba041cbd7d92a
• ocaml(Graph__Rand) = 4f99e4e25800b27fcd6d7d759ee9589c
• ocaml(Graph__Sig) = 4ddcf9664464aedf72387fae83183869
• ocaml(Graph__Sig_pack) = 628ad314aaa9c55c959aa334aa724c88
• ocaml(Graph__Topological) = 735fefdfc87aa94a561e1e491464306c
• ocaml(Graph__Traverse) = d4d3f8efe830efbbd4b76624768c5648
• ocaml(Graph__Unionfind) = dce8d198fef2f4a359a4e0a7ce6a74d5
• ocaml(Graph__Util) = e480da434cd872f382c97f6ddcd5e47c
• ocaml(Graph__WeakTopological) = 0d832f69b6770814c3b428f8007b9c33
• ocaml(Graph__XDot) = eaf97ff7809016f774092863f9a43372
• ocaml(Graph__XDotDraw) = 69eda7807a74855f23737682d3367318
• ocaml(Stdlib) = cfc6abca663b2d71db1750a2c051cf6e
• ocaml(Stdlib__Array) = 9d976b3b47c2c5800331b7449565b98c
• ocaml(Stdlib__Buffer) = bf6c18db9a96f4c2d97dddb7f07cdee4
• ocaml(Stdlib__Domain) = 24d9be01b1377d92ed29d08905486a54
• ocaml(Stdlib__Either) = c90604673db95a8e7dbd131a219e37c5
• ocaml(Stdlib__Filename) = f74cc059dcb93d696ed0ec81c946c31f
• ocaml(Stdlib__Format) = 60af4e0c98f0be0b9d368a2a09700b3a
• ocaml(Stdlib__Fun) = cf215dbe3f6e56ca14fc22123b7eb171
• ocaml(Stdlib__Hashtbl) = 62d90b388a282ba341dbe91a50a61569
• ocaml(Stdlib__Int32) = c023c5ff3d236c9ddea65bf3e12846b5
• ocaml(Stdlib__Int64) = 7f664408b0d5725b26a41d8fe82de705
• ocaml(Stdlib__Lazy) = 1d6be45458ac0f04df24caf4c6b0825f
• ocaml(Stdlib__Lexing) = 3e6ab8b82b1880d4ad2ced0d57aca6f7
• ocaml(Stdlib__List) = a30617a473d55bfeb31bc8cb1d8035c0
• ocaml(Stdlib__Map) = c89b7925344cf894dcfa15de9855271e
• ocaml(Stdlib__Nativeint) = 7b40cfad9e114c0baec17b5f3a644be3
• ocaml(Stdlib__Obj) = 95b257801d6620efb9f733a08b806029
• ocaml(Stdlib__Option) = 1f125c281d6cce512ab4ed7b9a269937
• ocaml(Stdlib__Parsing) = bd54edc573639370f05685f6024fec11
• ocaml(Stdlib__Printf) = 53d0458f8bd9e6a47c1910b76e8b6f06
• ocaml(Stdlib__Queue) = b8e767cc53f52dafa1719c723bf4b181
• ocaml(Stdlib__Random) = 2aa639764f27c99788afa2b2dbf2e75f
• ocaml(Stdlib__Scanf) = f1fb8faa0240204ffa3944fe78ada705
• ocaml(Stdlib__Seq) = a98573564faae435d9a1e05d5d2938ff
• ocaml(Stdlib__Set) = 35df46d1279edd62fbcfbe1072794627
• ocaml(Stdlib__Stack) = df4c36d6bbb131372027ae59ce7346dc
• ocaml(Stdlib__String) = 11ee86c6d03e0b37a2ef80541f3e00be
• ocaml(Stdlib__Sys) = aa921c44c52af557dede0ef5720a3515
• ocaml(Stdlib__Uchar) = cc650ed80ecb08760ed6479a6adeec7b
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsZstd) <= 5.4.18-1

License

LGPL-2.1-only WITH OCaml-LGPL-linking-exception

Changelog

* Sat Apr 05 2025 pterjan <pterjan> 2.1.0-1.mga10
  + Revision: 2173772
  - Update to 2.1.0

Files

/usr/lib/.build-id
/usr/lib/.build-id/15
/usr/lib/.build-id/15/52fa7ca06f5d8c3675cf52cf241a8f1b40f2a6
/usr/lib64/ocaml/ocamlgraph
/usr/lib64/ocaml/ocamlgraph/META
/usr/lib64/ocaml/ocamlgraph/graph.cma
/usr/lib64/ocaml/ocamlgraph/graph.cmi
/usr/lib64/ocaml/ocamlgraph/graph.cmxs
/usr/lib64/ocaml/ocamlgraph/graph__.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Bitv.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Blocks.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Builder.cmi
/usr/lib64/ocaml/ocamlgraph/graph__ChaoticIteration.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Classic.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Clique.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Cliquetree.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Coloring.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Components.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Contraction.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Cycles.cmi
/usr/lib64/ocaml/ocamlgraph/graph__DGraphModel.cmi
/usr/lib64/ocaml/ocamlgraph/graph__DGraphRandModel.cmi
/usr/lib64/ocaml/ocamlgraph/graph__DGraphSubTree.cmi
/usr/lib64/ocaml/ocamlgraph/graph__DGraphTreeLayout.cmi
/usr/lib64/ocaml/ocamlgraph/graph__DGraphTreeModel.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Delaunay.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Dominator.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Dot.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Dot_ast.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Dot_lexer.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Dot_parser.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Eulerian.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Fixpoint.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Flow.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Gmap.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Gml.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Graphml.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Graphviz.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Heap.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Imperative.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Kruskal.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Leaderlist.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Mcs_m.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Md.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Merge.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Mincut.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Minsep.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Nonnegative.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Oper.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Pack.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Path.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Persistent.cmi
/usr/lib64/ocaml/ocamlgraph/graph__PersistentQueue.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Prim.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Rand.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Sig.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Sig_pack.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Strat.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Topological.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Traverse.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Unionfind.cmi
/usr/lib64/ocaml/ocamlgraph/graph__Util.cmi
/usr/lib64/ocaml/ocamlgraph/graph__WeakTopological.cmi
/usr/lib64/ocaml/ocamlgraph/graph__XDot.cmi
/usr/lib64/ocaml/ocamlgraph/graph__XDotDraw.cmi
/usr/share/doc/ocaml-ocamlgraph
/usr/share/doc/ocaml-ocamlgraph/CREDITS
/usr/share/doc/ocaml-ocamlgraph/FAQ
/usr/share/licenses/ocaml-ocamlgraph
/usr/share/licenses/ocaml-ocamlgraph/COPYING
/usr/share/licenses/ocaml-ocamlgraph/LICENSE

Generated by rpm2html 1.8.1

Fabrice Bellet, Wed Apr 9 09:02:51 2025