package containers

  1. Overview
  2. Docs
package containers
Legend:
Library
Module
Module type
Parameter
Class
Class type
type (!'id, !'v, !'e) t = {
  1. eq : 'id -> 'id -> bool;
  2. hash : 'id -> int;
  3. force : 'id -> ('id, 'v, 'e) node;
}
and (!'id, !'v, !'e) node =
  1. | Empty
  2. | Node of 'id * 'v * ('e * 'id) CCSequence.t
and (!'id, !'e) path = ('id * 'e * 'id) list
val empty : ('id, 'v, 'e) t
val singleton : ?eq:('id -> 'id -> bool) -> ?hash:('id -> int) -> 'id -> 'v -> ('id, 'v, 'e) t
val make : ?eq:('id -> 'id -> bool) -> ?hash:('id -> int) -> ('id -> ('id, 'v, 'e) node) -> ('id, 'v, 'e) t
val from_enum : ?eq:('id -> 'id -> bool) -> ?hash:('id -> int) -> vertices:('id * 'v) CCSequence.t -> edges:('id * 'e * 'id) CCSequence.t -> ('id, 'v, 'e) t
val from_list : ?eq:('id -> 'id -> bool) -> ?hash:('id -> int) -> ('id * 'e * 'id) list -> ('id, 'id, 'e) t
val from_fun : ?eq:('id -> 'id -> bool) -> ?hash:('id -> int) -> ('id -> ('v * ('e * 'id) list) option) -> ('id, 'v, 'e) t
type (!'id, !'v, !'e) graph = ('id, 'v, 'e) t
module Mutable : sig ... end
module Full : sig ... end
val bfs : ('id, 'v, 'e) t -> 'id -> ('id * 'v * int) CCSequence.t
val dfs : ('id, 'v, 'e) t -> 'id -> ('id * 'v * int) CCSequence.t
module Heap : sig ... end
val a_star : ('id, 'v, 'e) t -> ?on_explore:('id -> unit) -> ?ignore:('id -> bool) -> ?heuristic:('id -> float) -> ?distance:('id -> 'e -> 'id -> float) -> goal:('id -> bool) -> 'id -> (float * ('id, 'e) path) CCSequence.t
val dijkstra : ('id, 'v, 'e) t -> ?on_explore:('id -> unit) -> ?ignore:('id -> bool) -> ?distance:('id -> 'e -> 'id -> float) -> 'id -> 'id -> float * ('id, 'e) path
val is_dag : ('id, 'a, 'b) t -> 'id -> bool
val is_dag_full : ('id, 'a, 'b) t -> 'id CCSequence.t -> bool
val find_cycle : ('id, 'a, 'e) t -> 'id -> ('id, 'e) path
val rev_path : ('id, 'e) path -> ('id, 'e) path
val union : ?combine:('v -> 'v -> 'v) -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
val map : vertices:('v -> 'v2) -> edges:('e -> 'e2) -> ('id, 'v, 'e) t -> ('id, 'v2, 'e2) t
val flatMap : ('id -> 'id CCSequence.t) -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
val filter : ?vertices:('id -> 'v -> bool) -> ?edges:('id -> 'e -> 'id -> bool) -> ('id, 'v, 'e) t -> ('id, 'v, 'e) t
val product : ('id1, 'v1, 'e1) t -> ('id2, 'v2, 'e2) t -> ('id1 * 'id2, 'v1 * 'v2, 'e1 * 'e2) t
module Infix : sig ... end
module Dot : sig ... end
val divisors_graph : (int, int, unit) t
val collatz_graph : (int, int, unit) t
val collatz_graph_bis : (int, int, bool) t
val heap_graph : (int, int, unit) t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct