You can search for identifiers within the package.
in-package search v0.2.0
Graph traversal.
module type G = sig ... end
Minimal graph signature for Dfs and Bfs. Sub-signature of Sig.G.
Dfs
Bfs
Sig.G
module Dfs (G : G) : sig ... end
Depth-first search
module Bfs (G : G) : sig ... end
Breadth-first search
Provide a more efficient version of depth-first algorithm when graph vertices are marked.
module type GM = sig ... end
Minimal graph signature for graph traversal with marking. Sub-signature of Sig.IM.
Sig.IM
module Mark (G : GM) : sig ... end
Graph traversal with marking. Only applies to imperative graphs with marks.