Module Graph__Traverse

Graph traversal.

Dfs and Bfs

module type G = sig ... end

Minimal graph signature for Dfs and Bfs. Sub-signature of Sig.G.

module Dfs : functor (G : G) -> sig ... end

Depth-first search

module Bfs : functor (G : G) -> sig ... end

Breadth-first search

Traversal with marking

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.

module Mark : functor (G : GM) -> sig ... end

Graph traversal with marking. Only applies to imperative graphs with marks.