diff --git a/lazyGraph.ml b/lazyGraph.ml
index 52d13a8c..b024ad6a 100644
--- a/lazyGraph.ml
+++ b/lazyGraph.ml
@@ -257,11 +257,6 @@ let dfs graph v =
       | _ -> None)
     (Full.dfs_full graph (Gen.singleton v))
 
-let enum graph v = (Gen.empty, Gen.empty)  (* TODO *)
-
-let depth graph v =
-  failwith "not implemented" (* TODO *)
-
 (** {3 Mutable heap (taken from heap.ml to avoid dependencies)} *)
 module Heap = struct
   type 'a t = {
@@ -389,10 +384,6 @@ let product g1 g2 =
   in
   { eq; hash; force; }
 
-let limit_depth ~max g =
-  (* TODO; this should be eager (compute depth by BFS) *)
-  failwith "not implemented"
-
 module Infix = struct
   let (++) g1 g2 = union ?combine:None g1 g2
 end
diff --git a/lazyGraph.mli b/lazyGraph.mli
index d2c28f61..8bab9501 100644
--- a/lazyGraph.mli
+++ b/lazyGraph.mli
@@ -129,12 +129,6 @@ val bfs : ('id, 'v, 'e) t -> 'id -> ('id * 'v * int) Gen.t
 val dfs : ('id, 'v, 'e) t -> 'id -> ('id * 'v * int) Gen.t
   (** Lazy traversal in depth first *)
 
-val enum : ('id, 'v, 'e) t -> 'id -> ('id * 'v) Gen.t * ('id * 'e * 'id) Gen.t
-  (** Convert to an enumeration. The traversal order is undefined. *)
-
-val depth : ('id, _, 'e) t -> 'id -> ('id, int, 'e) t
-  (** Map vertices to their depth, ie their distance from the initial point *)
-
 val disjktra : ('id, 'v, 'e) t ->
                ?distance:('id -> 'e -> 'id -> int) ->
                'id -> 'id ->
@@ -165,10 +159,6 @@ val product : ('id1, 'v1, 'e1) t -> ('id2, 'v2, 'e2) t ->
               ('id1 * 'id2, 'v1 * 'v2, 'e1 * 'e2) t
   (** Cartesian product of the two graphs *)
 
-val limit_depth : max:int -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
-  (** Return the same graph, but with a bounded depth. Vertices whose
-      depth is too high will be replaced by Empty *)
-
 module Infix : sig
   val (++) : ('id, 'v, 'e) t -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
     (** Union of graphs (alias for {! union}) *)