Strongly_connected_components.Make(3) OCaml library Strongly_connected_components.Make(3)

Strongly_connected_components.Make - no description

Module Strongly_connected_components.Make

Module Make
: functor (Id : Identifiable.S) -> sig end




module Id : Identifiable.S

type directed_graph = Id.Set.t Id.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.

type component =
| Has_loop of Id.t list
| No_loop of Id.t

val connected_components_sorted_from_roots_to_leaf : directed_graph -> component array

val component_graph : directed_graph -> (component * int list) array

2024-05-31 OCamldoc