Module type Graph__Traverse.G
Minimal graph signature for Dfs
and Bfs
. Sub-signature of Sig
.G.
module V : Graph.Sig.COMPARABLE
val iter_vertex : (V.t -> unit) -> t -> unit
It is enough to iter over all the roots (vertices without predecessor) of the graph, even if iterating over the other vertices is correct.