module I: functor (
G
:
Sig.I
) ->
sig
.. end
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
.
Same specification than module type S
but modify the graph inplace
instead of returning a new graph.
type
graph = G.t
type
edge_label = G.E.label
val merge_vertex : graph -> G.vertex list -> unit
val merge_edges_e : ?src:G.vertex -> ?dst:G.vertex -> graph -> G.edge list -> unit
val merge_edges_with_label : ?src:G.vertex ->
?dst:G.vertex ->
?label:edge_label -> graph -> edge_label -> unit
val merge_isolabelled_edges : graph -> unit
val merge_ends : ?strict:bool -> ?specified_vertex:G.vertex -> graph -> unit
val merge_starts : ?strict:bool -> ?specified_vertex:G.vertex -> graph -> unit
val merge_scc : ?loop_killer:bool ->
?specified_vertex:(G.vertex list -> G.vertex) -> graph -> unit