Functor Gmap.Edge


module Edge: 
functor (G_Init : sig
type t 
module E: Sig.HASHABLE 
val fold_edges_e : (E.t -> 'a -> 'a) -> t -> 'a -> 'a
end) ->
functor (G_Dest : sig
type t 
type edge 
val empty : unit -> t
val add_edge_e : t -> edge -> t
end) -> sig .. end
Parameters:
G_Init : sig type t module E : Sig.HASHABLE val fold_edges_e : (E.t -> 'a -> 'a) -> t -> 'a -> 'a end
G_Dest : sig type t type edge val empty : unit -> t val add_edge_e : t -> edge -> t end

val map : (G_Init.E.t -> G_Dest.edge) -> G_Init.t -> G_Dest.t
map f g applies f to each edge of g and so builds a new graph based on g