Dgraph.Make
N : sig ... end
NSet : Stdlib.Set.S with type NSet.elt = N.t
NMap : Stdlib.Map.S with type NMap.key = N.t
type t
=
{
domain : NSet.t;
fold_children : a. (N.t -> 'a -> 'a) -> N.t -> 'a -> 'a;
}
val invert : t -> t
module type DOMAIN = sig ... end
module Solver : functor (D : DOMAIN) -> sig ... end