Module type S
= sigendmoduleId:Identifiable.Stypedirected_graph = Id.Set.tId.Map.t
If (a -> set) belongs to the map, it means that there are edges from a to every element of set . It is
assumed that no edge points to a vertex not represented in the map.
typecomponent =
| Has_loop ofId.tlist
| No_loop ofId.tvalconnected_components_sorted_from_roots_to_leaf : directed_graph->componentarrayvalcomponent_graph : directed_graph->(component*intlist)array
OCamldoc 2025-06-12 Strongly_connected_components.S(3o)