package forester

You can search for identifiers within the package.

in-package search v0.2.0

A tool for tending mathematical forests

Install

Dune Dependency

sr.ht Readme Edit opam file Versions (17)

Authors

J

Jonathan Sterling

Maintainers

J

Jonathan Sterling

Sources

4.3.0.tar.gz

md5=4cf7ec6a0a36810572f8b3a2af58631c

sha512=818f859dac00a18807563fd79663ec54232c8df196a8dc2de5e269a1d0c71085b1b490297ea0ecf3ef9cd32e40fb05ad2e10c241b03958c15e25c2942271eede

doc/forester.frontend/Forester_frontend/Import_graph/Gph/index.html

Module `Import_graph.Gph`Source

include sig ... end

Sourcetype t

module V : sig ... end

Sourcetype vertex = V.t

module E : sig ... end

Sourcetype edge = E.t

Sourceval is_directed : bool

Sourceval is_empty : t -> bool

Sourceval nb_vertex : t -> int

Sourceval nb_edges : t -> int

Sourceval out_degree : t -> vertex -> int

Sourceval in_degree : t -> vertex -> int

Sourceval mem_vertex : t -> vertex -> bool

Sourceval mem_edge : t -> vertex -> vertex -> bool

Sourceval mem_edge_e : t -> edge -> bool

Sourceval find_edge : t -> vertex -> vertex -> edge

Sourceval find_all_edges : t -> vertex -> vertex -> edge list

Sourceval succ : t -> vertex -> vertex list

Sourceval pred : t -> vertex -> vertex list

Sourceval succ_e : t -> vertex -> edge list

Sourceval pred_e : t -> vertex -> edge list

Sourceval iter_vertex : (vertex -> unit) -> t -> unit

Sourceval fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a

Sourceval iter_edges : (vertex -> vertex -> unit) -> t -> unit

Sourceval fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a

Sourceval iter_edges_e : (edge -> unit) -> t -> unit

Sourceval fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a

Sourceval map_vertex : (vertex -> vertex) -> t -> t

Sourceval iter_succ : (vertex -> unit) -> t -> vertex -> unit

Sourceval iter_pred : (vertex -> unit) -> t -> vertex -> unit

Sourceval fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval iter_succ_e : (edge -> unit) -> t -> vertex -> unit

Sourceval fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval iter_pred_e : (edge -> unit) -> t -> vertex -> unit

Sourceval fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval create : ?size:int -> unit -> t

Sourceval clear : t -> unit

Sourceval copy : t -> t

Sourceval add_vertex : t -> vertex -> unit

Sourceval remove_vertex : t -> vertex -> unit

Sourceval add_edge : t -> vertex -> vertex -> unit

Sourceval add_edge_e : t -> edge -> unit

Sourceval remove_edge : t -> vertex -> vertex -> unit

Sourceval remove_edge_e : t -> edge -> unit

Sourceval safe_succ : t -> Forester_core.addr -> Forester_core.addr list

Sourceval safe_pred : t -> Forester_core.addr -> Forester_core.addr list