package ocamlgraph

  1. Overview
  2. Docs
A generic graph library for OCaml

Install

Dune Dependency

Authors

Maintainers

Sources

ocamlgraph-2.0.0.tbz
sha256=20fe267797de5322088a4dfb52389b2ea051787952a8a4f6ed70fcb697482609
sha512=c4973ac03bdff52d1c8a1ed01c81e0fbe2f76486995e57ff4e4a11bcc7b1793556139d52a81ff14ee8c8de52f1b40e4bd359e60a2ae626cc630ebe8bccefb3f1

Description

Provides both graph data structures and graph algorithms

README

OCamlgraph

OCamlgraph is a graph library for Ocaml. Its contribution is three-fold:

  1. It provides an easy-to-use graph implementation together with several operations and algorithms over graphs, in Graph.Pack.Digraph. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers.

    Have a look at this module first in order to get an overview of what this library provides. See also demo.ml.

  2. Then OCamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (immutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc.

    See interface Sig for the graph signatures and modules Persistent and Imperative for the implementations.

    These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result.

  3. Finally, OCamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc.

Documentation

https://backtracking.github.io/ocamlgraph/

Examples

You'll find examples of OCamlgraph use in subdirectory examples/ (demo.ml, demo_planar.ml, color.ml, etc.).

Bug reports

https://github.com/backtracking/ocamlgraph/issues

Dependencies (2)

  1. stdlib-shims
  2. ocaml >= "4.03.0"

Dev Dependencies (2)

  1. graphics with-test
  2. dune >= "2.0" & !with-test | >= "2.8"

Used by (52)

  1. acgtk >= "2.0.0"
  2. acpc >= "1.2" & < "2.0.0"
  3. alt-ergo < "1.01"
  4. altgr-ergo < "1.01"
  5. archsat
  6. awsm-codegen
  7. bap >= "0.9.2" & < "1.0.0"
  8. bap-phoenix
  9. binsec >= "0.4.0"
  10. bistro >= "0.2.0"
  11. caisar >= "0.2.1"
  12. caisar-ir
  13. caisar-xgboost
  14. catala
  15. colibri2
  16. depgraph
  17. doculib >= "1.3.5"
  18. dose3 >= "5.0.1-1"
  19. forester < "2.4"
  20. frama-c >= "8.0" & < "10.0" | >= "22.0" & < "28.0~beta"
  21. frenetic >= "3.0.0" & < "3.2.0" | >= "5.0.0"
  22. functoria < "4.0.0~beta1"
  23. GT
  24. git
  25. graphlib
  26. heptagon
  27. hts_shrink < "3.0.1"
  28. irmin
  29. modelica_ml >= "0.2.0"
  30. molenc >= "11.4.0"
  31. not-ocamlfind >= "0.07.01"
  32. nuscr
  33. ocamlgraph_gtk
  34. opa-base
  35. opam-core
  36. opam-lib < "1.3.1"
  37. ott >= "0.33"
  38. pa_ppx_ag >= "0.08"
  39. pfff >= "0.37.1"
  40. planck >= "2.1.1"
  41. prbnmcn-stats >= "0.0.5"
  42. rfsm
  43. rotor
  44. satML-plugin < "1.01"
  45. satyrographos >= "0.0.2.7"
  46. solvuu-build
  47. solvuu_build
  48. sparrow
  49. squirrel
  50. tezos-benchmark
  51. topology >= "0.4.0"
  52. why3 >= "0.85" & < "1.0.0"

Conflicts

None