Ready for release 1.8.3

CHANGES

@@ -1,4 +1,6 @@
 
+version 1.8.3, April 17, 2013
+---------------------------
  o new module Merge implementing several different of merges of vertices and
    edges into a graph (contributed by Emmanuel Haucourt)
  o fixed DOT parser (contributed by Alex Reece)

Makefile.in

@@ -106,7 +106,7 @@ graph.cmo: $(CMI) $(CMO)
 graph.cmx: $(CMI) $(CMX)
 	$(OCAMLOPT) $(INCLUDES) -pack -o $@ $^
 
-VERSION=1.8.2+svn
+VERSION=1.8.3
 
 src/version.ml: Makefile
 	rm -f $@

src/merge.ml

@@ -34,7 +34,7 @@ module type S = sig
     graph
 end
 
-module B(B: Graph.Builder.S) = struct
+module B(B: Builder.S) = struct
 
   type graph = B.G.t
   type vertex = B.G.vertex
@@ -176,7 +176,7 @@ module B(B: Graph.Builder.S) = struct
     merge_vertex g to_be_merged
 
   let merge_scc ?(loop_killer=false) ?specified_vertex g =
-    let module C = Graph.Components.Make(B.G) in
+    let module C = Components.Make(B.G) in
     let components = C.scc_list g in
     let alter accu to_be_identified =
       let to_be_identified =
@@ -192,10 +192,10 @@ module B(B: Graph.Builder.S) = struct
 
 end
 
-module P(G: Graph.Sig.P) = B(Graph.Builder.P(G))
+module P(G: Sig.P) = B(Builder.P(G))
 
-module I(G: Graph.Sig.I) = struct
-  include B(Graph.Builder.I(G))
+module I(G: Sig.I) = struct
+  include B(Builder.I(G))
   let merge_vertex g vl = ignore (merge_vertex g vl)
   let merge_edges_e ?src ?dst g el = ignore (merge_edges_e ?src ?dst g el)
   let merge_edges_with_label ?src ?dst ?label g l =

src/merge.mli

@@ -99,19 +99,19 @@ module type S = sig
 end
 
 (** Extension for the module [X].*)
-module B(X: Graph.Builder.S) : S with type graph = X.G.t
+module B(X: Builder.S) : S with type graph = X.G.t
 			   and type vertex := X.G.vertex
 			   and type edge := X.G.edge
 			   and type edge_label = X.G.E.label
 
 (**Extension for the module [G].*)
-module P(G: Graph.Sig.P): S with type graph = G.t
+module P(G: Sig.P): S with type graph = G.t
 		      and type vertex := G.vertex
 		      and type edge := G.edge
 		      and type edge_label = G.E.label
 
 (**Extension for the module [G].*)
-module I(G: Graph.Sig.I): sig
+module I(G: Sig.I): sig
 
   (** Same specification than module type {!S} but modify the graph inplace
       instead of returning a new graph. *)