dwww Home | Manual pages | Find package

Strongly_connected_components.MakOCaml lStrongly_connected_components.Make(3o)

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  ver-
       tex 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                          2023-0Strongly_connected_components.Make(3o)

Generated by dwww version 1.15 on Sun Jun 23 03:40:05 CEST 2024.