module Make:
| Parameters: |
|
val scc : Components.G.t -> G.V.t -> intscc g computes the strongly connected components of g.
The result is a function f such that f u = f v if and only if
u and v are in the same component.
Beware: to be used efficiently, scc must be applied to a single
argument (the graph).val scc_list : Components.G.t -> G.V.t list listscc_list computes the strongly connected components of g.
The result is a partition of the set of the vertices of g.