Wed, 18 Nov 2026 19:43:36 UTC Log in
OCaml library for arc and node graphs 342.05 KB built 2026-10-16 12:55:34 GMT

Description

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.

Dependencies

12 total
Requires7
  • ocaml >= 4.08.0
  • ocaml-dune >= 2.0
  • ocaml-graphics-devel
  • ocaml-lablgtk-devel
  • pkgconfig(libgnomecanvas-2.0)
  • rpmlib(CompressedFileNames) <= 3.0.4-1
  • rpmlib(FileDigests) <= 4.6.0-1
Provides5
  • ocaml-ocamlgraph = 2.2.0-6.fc45
  • ocaml-ocamlgraph-devel = 2.2.0-6.fc45
  • ocaml-ocamlgraph-gtk = 2.2.0-6.fc45
  • ocaml-ocamlgraph-gtk-devel = 2.2.0-6.fc45
  • ocaml-ocamlgraph-tools = 2.2.0-6.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances

Files

2
Files 1–2 of 2

Component of

buildroots that installed this RPM

No Buildroots