You can search for identifiers within the package.
in-package search v0.2.0
type node
type graph
type node_set
val leaves : graph -> node_set
val empty : graph
val add_edge : node -> node -> graph -> graph
val add_edges : node -> node list -> graph -> graph
val children : graph -> node -> node list
val reachable : node_set -> node_set -> graph -> node_set
val prune : node_set -> node_set -> graph -> graph
val remove_self_loops : graph -> graph
val reverse : graph -> graph
exception Not_a_DAG of node * graph
val topsort : graph -> node list
val scc : ?original_order:node list -> graph -> node list list
val make_dot : (node -> string) -> (node -> node -> string) -> (node -> string) -> Stdlib.out_channel -> graph -> unit