You can search for identifiers within the package.
in-package search v0.2.0
module G : G
val sccs : G.t -> G.v list list
pure implementation of sccs. random tested with sccs implementation of OCamlGraph
val div_by_components : G.t -> G.v list list -> (G.v list * G.v list list) list
Get edges of graph divided by components. Each components must be non empty. They must be distinct each other.
val toposort : G.t -> G.v list option
If a graph contains a cycle, returns None
None