anil.recoil.org
The unpac monorepo manager self-hosting as a monorepo using unpac
Update README.md
authored by
Jean-Christophe Filliatre
and committed by
GitHub
1129b9c5
425ec0fe
+6
-5
README.md
+6
-5
README.md
···
3
3
OCamlgraph is a graph library for OCaml. Its contribution is three-fold:
4
4
5
5
1. It provides an easy-to-use graph implementation together with several
6
-
operations and algorithms over graphs, in Graph.Pack.Digraph.
6
+
operations and algorithms over graphs, in [`Graph.Pack.Digraph`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Pack/Digraph/index.html).
7
7
It is a reasonably efficient imperative data structure for directed graphs
8
8
with vertices and edges labeled with integers.
9
9
10
10
Have a look at this module first in order to get an overview of what
11
-
this library provides. See also `demo.ml`.
11
+
this library provides. See also [`demo.ml`](https://github.com/backtracking/ocamlgraph/blob/master/examples/demo.ml).
12
12
13
13
2. Then OCamlgraph provides several other graph implementations for those
14
14
not satisfied with the one above. Some are persistent (immutable) and other
···
16
16
Some have labels for vertices, or labels for edges, or both.
17
17
Some have abstract types for vertices. etc.
18
18
19
-
See interface Sig for the graph signatures and modules Persistent and
20
-
Imperative for the implementations.
19
+
See interface [`Sig`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Sig/index.html)
20
+
for the graph signatures and modules [`Persistent`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Persistent/index.html) and
21
+
[`Imperative`](https://backtracking.github.io/ocamlgraph/ocamlgraph/Graph/Imperative/index.html) for the implementations.
21
22
22
23
These implementations are written as functors: you give the types of
23
24
vertices labels, edge labels, etc. and you get the data structure as a
24
25
result.
25
26
26
-
3. Finally, OCamlgraph provides several classic operations and algorithms
27
+
4. Finally, OCamlgraph provides several classic operations and algorithms
27
28
over graphs. They are also written as functors i.e. independently of the
28
29
data structure for graphs. One consequence is that you can define your own
29
30
data structure for graphs and yet re-use all the algorithms from this