module Vertex: functor (
G_Init
:
sig
type
t
module V: Sig.HASHABLE
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
end
) ->
functor (
G_Dest
:
sig
type
t
type
vertex
val empty : unit -> t
val add_vertex : t -> vertex -> t
end
) ->
sig
.. end
Parameters: |
G_Init |
: |
sig
type t
module V : Sig.HASHABLE
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
end
|
G_Dest |
: |
sig
type t
type vertex
val empty : unit -> t
val add_vertex : t -> vertex -> t
end
|
|
val map : (G_Init.V.t -> G_Dest.vertex) -> G_Init.t -> G_Dest.t
map f g
applies f
to each vertex of g
and so builds a new graph
based on g