module Store = SStore used as a graph.
module K : Graph.Sig.I with type V.t = Store.Hash.tAn imperative Graph of the store.
val keys : K.t -> Store.Hash.t listkeys graph returns all hashes recheables in the graph graph.
of_commits store makes a new graph from all commits of a store.
val closure : ?full:bool -> Store.t -> min:Store.Hash.Set.t -> max:Store.Hash.Set.t -> K.t Lwt.tval pack : Store.t -> min:Store.Hash.Set.t -> max:Store.Hash.Set.t -> (Store.Hash.t * Store.Value.t) list Lwt.tval to_dot : Store.t -> Stdlib.Format.formatter -> unit Lwt.t