You can search for identifiers within the package.
in-package search v0.2.0
val iter : ?pre:(G.V.t -> unit) -> ?post:(G.V.t -> unit) -> G.t -> unit
val prefix : (G.V.t -> unit) -> G.t -> unit
val postfix : (G.V.t -> unit) -> G.t -> unit
val iter_component : ?pre:(G.V.t -> unit) -> ?post:(G.V.t -> unit) -> G.t -> G.V.t -> unit
val prefix_component : (G.V.t -> unit) -> G.t -> G.V.t -> unit
val postfix_component : (G.V.t -> unit) -> G.t -> G.V.t -> unit
val fold : (G.V.t -> 'a -> 'a) -> 'a -> G.t -> 'a
val fold_component : (G.V.t -> 'a -> 'a) -> 'a -> G.t -> G.V.t -> 'a
type iterator = Graph.Traverse.Dfs(G).iterator
val start : G.t -> iterator
val step : iterator -> iterator
val get : iterator -> G.V.t
val has_cycle : G.t -> bool