Fedora Packages


OCaml library for arc and node graphs

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.

Releases Overview

Release Stable Testing
Fedora Rawhide 2.1.0-1.fc40 -
Fedora 39 2.1.0-1.fc39 2.1.0-1.fc39
Fedora 38 2.0.0-11.fc38 -
Fedora 37 2.0.0-9.fc37 -
File a new bug report »
Package Info
Related Packages

You can contact the maintainers of this package via email at ocaml-ocamlgraph dash maintainers at fedoraproject dot org.

Sources on Pagure