Legend:
Library
Module
Module type
Parameter
Class
Class type
Graph traversal.
Dfs and Bfs
In the modules below, the most meaningful functions are the iter/fold_component functions, where the starting point of the traversal is user-provided.
Functions iter/fold to traverse the whole graph are also provided, for convenience, and they proceed as follows: they run the user-provided iter/fold_vertex functions (from input module G) and, for each vertex not yet visited, start a new traversal from this vertex. In particular, each traversal is not necessarily started from a vertex without predecessors. Said otherwise, it is up to you to come up with an iter_vertex function that will identify suitable roots, e.g. vertices with no predecessors, if this is really what you want.