package ocamlgraph

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type

Minimal graph signature for Dfs and Bfs. Sub-signature of Sig.G.

val is_directed : bool
type t
module V : Sig.COMPARABLE
val iter_vertex : (V.t -> unit) -> t -> unit

It is enough to iter over all the roots (vertices without predecessor) of the graph, even if iterating over the other vertices is correct. (See the comment above.)

val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a

It is enough to fold over all the roots (vertices without predecessor) of the graph, even if folding over the other vertices is correct. (See the comment above.)

val iter_succ : (V.t -> unit) -> t -> V.t -> unit
val fold_succ : (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
OCaml

Innovation. Community. Security.