1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
(*
* Graph: generic graph library
* Copyright (C) 2004
* Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles
*
* This software is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License version 2, as published by the Free Software Foundation.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* See the GNU Library General Public License version 2 for more details
* (enclosed in the file LGPL).
*)
(* $Id: builder.ml,v 1.12 2004/02/20 14:37:40 signoles Exp $ *)
open Sig
module type S = sig
module G : Sig.G
val empty : unit -> G.t
val copy : G.t -> G.t
val add_vertex : G.t -> G.V.t -> G.t
val add_edge : G.t -> G.V.t -> G.V.t -> G.t
val add_edge_e : G.t -> G.E.t -> G.t
end
module type INT = S with type G.V.label = int
module P(G : Sig.P) = struct
module G = G
let empty () = G.empty
let copy g = g
let add_vertex = G.add_vertex
let add_edge = G.add_edge
let add_edge_e = G.add_edge_e
end
module I(G : Sig.I) = struct
module G = G
let empty = G.create
let copy = G.copy
let add_vertex g v = G.add_vertex g v; g
let add_edge g v1 v2 = G.add_edge g v1 v2; g
let add_edge_e g e = G.add_edge_e g e; g
end
|