simon/ocaml-containers
1
0
Fork 0
mirror of https://github.com/c-cube/ocaml-containers.git synced 2025-12-07 03:35:30 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

removed some non implemented functions from LazyGraph

Browse source
This commit is contained in:
Simon Cruanes 2013-03-29 23:19:10 +01:00
parent 974df85321
commit fe0b4d653f
2 changed files with 0 additions and 19 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
lazyGraph.ml
View file

@ -257,11 +257,6 @@ let dfs graph v =
| _ -> None) | _ -> None)
(Full.dfs_full graph (Gen.singleton v)) (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)} *) (** {3 Mutable heap (taken from heap.ml to avoid dependencies)} *)
module Heap = struct module Heap = struct
type 'a t = { type 'a t = {
@ -389,10 +384,6 @@ let product g1 g2 =
in in
{ eq; hash; force; } { eq; hash; force; }
let limit_depth ~max g =
(* TODO; this should be eager (compute depth by BFS) *)
failwith "not implemented"
module Infix = struct module Infix = struct
let (++) g1 g2 = union ?combine:None g1 g2 let (++) g1 g2 = union ?combine:None g1 g2
end end

10
lazyGraph.mli
View file

@ -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 val dfs : ('id, 'v, 'e) t -> 'id -> ('id * 'v * int) Gen.t
(** Lazy traversal in depth first *) (** 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 -> val disjktra : ('id, 'v, 'e) t ->
?distance:('id -> 'e -> 'id -> int) -> ?distance:('id -> 'e -> 'id -> int) ->
'id -> 'id -> 'id -> 'id ->
@ -165,10 +159,6 @@ val product : ('id1, 'v1, 'e1) t -> ('id2, 'v2, 'e2) t ->
('id1 * 'id2, 'v1 * 'v2, 'e1 * 'e2) t ('id1 * 'id2, 'v1 * 'v2, 'e1 * 'e2) t
(** Cartesian product of the two graphs *) (** 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 module Infix : sig
val (++) : ('id, 'v, 'e) t -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t val (++) : ('id, 'v, 'e) t -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
(** Union of graphs (alias for {! union}) *) (** Union of graphs (alias for {! union}) *)