Strongly_connected_components.S(3OCaml librStrongly_connected_components.S(3o)
NAME
Strongly_connected_components.S - no description
Module type
Module type Strongly_connected_components.S
Documentation
Module type 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 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-02-1Strongly_connected_components.S(3o)
Generated by dwww version 1.15 on Sat Jun 22 00:20:56 CEST 2024.