Strongly_connected_components.Make(3)                            OCaml library

NAME
       Strongly_connected_components.Make - no description

Module
       Module   Strongly_connected_components.Make

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




       Parameters:

       "Id"

       Identifiable.S







       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




OCamldoc                          2024-02-29
                                         Strongly_connected_components.Make(3)