module I:Imperative implementationfunctor (
Gf
:
Sig.G
) ->
functor (
Gt
:
Sig.I
) ->
functor (
M
:
sig
val vertex :Gt.t -> Gf.V.t -> Gt.V.t
vertex g' v
modifies the new graph and return the vertex corresponding tov
in this graph.
val edge :Gt.t -> Gt.V.t -> Gt.V.t -> unit
edge g' v1' v2'
modifies the new graph given the images of two vertices that had an edge in the original graph
end
) ->
sig
..end
Parameters: |
|
val copy : Gf.t -> Gt.t
copy g
Copy the graph g
using M.vertex
and M.edge