logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

Strongly_connected_components.Make - no description

Documentation

       Module Make
        : (Id:Identifiable.S)->sigendParameters:

       "Id"

       Identifiable.SmoduleId: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.Make(3o)

Module

       Module   Strongly_connected_components.Make

Name

       Strongly_connected_components.Make - no description

See Also