https://github.com/backtracking/ocamlgraph

OCaml graph library
https://github.com/backtracking/ocamlgraph

Last synced: 3 months ago
JSON representation

OCaml graph library

• Host: GitHub
• URL: https://github.com/backtracking/ocamlgraph
• Owner: backtracking
• License: other
• Created: 2013-06-05T09:26:06.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2024-07-24T15:32:54.000Z (4 months ago)
• Last Synced: 2024-07-24T18:02:41.089Z (4 months ago)
• Language: OCaml
• Homepage: http://backtracking.github.io/ocamlgraph/
• Size: 13.6 MB
• Stars: 226
• Watchers: 16
• Forks: 63
• Open Issues: 19
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGES.md
  • License: COPYING

Awesome Lists containing this project

• awesome-ocaml - OCamlgraph

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`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Pack/Digraph/index.html).

   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`](https://github.com/backtracking/ocamlgraph/blob/master/examples/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`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Sig/index.html)

   for the graph signatures and modules [`Persistent`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Persistent/index.html) and

   [`Imperative`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Imperative/index.html) 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.

4. 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