2
version 0.90, November 30th, 2004
3
---------------------------------
5
o version.ml and META files are now writable
6
o add interfaces Sig.VERTEX and Sig.EDGE
7
o "sig.ml" and "sig_pack.ml" removed; ocamlgraph now requires ocaml 3.08.0
8
o improvement of Minsep
9
o add Components.scc_list
10
o Oper.Neighbourhood replaces Neighborhood
12
o add types Sig_pack.vertex and Sig_pack.edge
13
o fixed bug in Ford-Fulkerson: G.V.equal instead of = in two asserts
15
version 0.81, July 13th, 2004
16
-----------------------------
17
o compatibility with ocaml 3.08
18
o Oper.Choose.choose_edge: choose an edge in a graph
19
o add types Sig.G.edge and Sig.G.vertex resp. equal to Sig.G.V.t and Sig.G.E.t
20
o fixed typos in invalid_arg arguments (in Bitv)
22
version 0.80, June 28th, 2004
23
-----------------------------
24
o major contribution by Matthieu Sozeau and Pierre-Lo�c Garoche.
26
- Md: Minimum Degree algorithm
27
- Cliquetree: the clique tree of a graph
28
- Mcs_m: Maximal Cardinality Search (MCS-M) algorithm
29
- Minsep: Minimal separators of a graph
30
- Neighborhood: compute the neighborhood of a vertex/some vertices
31
- Oper.Difference: subgraphs induced by the elimination of some vertices
32
- Oper.Choose: choose a vertex in a graph
33
- Copy: graphs copying
34
- Util.DataV: create a vertex type with data attached to it
35
o out_degree: raises Invalid_argument if v not in g (instead of Not_found)
36
o Pack.Graph: golberg/ford_fulkerson fail ("not a directed graph")
2
38
version 0.70, Feb 27th, 2004
3
---------------------------
39
----------------------------
4
40
o Makefile.in: dependences ("make -j" works)
5
41
o union and intersection (see Oper.S.union and Oper.S.intersection)
6
42
o Golberg/Ford_fulkerson algorithms in a single module Flow
8
44
o Ford_fulkerson: maxflow now returns a flow function over edges
10
46
version 0.60, Feb 18th, 2004
11
---------------------------
47
----------------------------
12
48
o fixed bug in Ford-Fulkerson
13
49
o random planar graphs (see Rand.Planar)
14
50
o Delaunay triangulation (see Delaunay)
17
53
o Traverse.Dfs.{prefix,prefix_component} optimized (now tail recursive)
19
55
version 0.50, Feb 4th, 2004
20
--------------------------
56
---------------------------
added
removed
CHANGES
