Classic.P
module G : sig ... end
type graph = G.t
type vertex = G.V.t
val divisors : int -> graph
val de_bruijn : int -> graph
val vertex_only : int -> graph
val full : ?self:bool -> int -> graph
val cycle : int -> graph * vertex array
val grid : n:int -> m:int -> graph * vertex array array