You can search for identifiers within the package.
in-package search v0.2.0
module G : G
val recursive_scc : G.t -> G.V.t -> G.V.t t
recursive_scc g root_g computes a weak topological ordering of the vertices of g, with the general algorithm recursively computing the strongly connected components of g. root_g is taken as the root of the graph and must be a valid vertex of g.
recursive_scc g root_g
g
root_g