1Strongly_connected_components.S(3)OCaml librarSytrongly_connected_components.S(3)
2
3
4

NAME

6       Strongly_connected_components.S - no description
7

Module type

9       Module type   Strongly_connected_components.S
10

Documentation

12       Module type S
13        = sig end
14
15
16
17
18
19
20
21       module Id : Identifiable.S
22
23
24
25
26       type directed_graph = Id.Set.t Id.Map.t
27
28
29       If  (a -> set) belongs to the map, it means that there are edges from a
30       to every element of set .  It is assumed that no edge points to a  ver‐
31       tex not represented in the map.
32
33
34       type component =
35        | Has_loop of Id.t list
36        | No_loop of Id.t
37
38
39
40
41
42       val  connected_components_sorted_from_roots_to_leaf : directed_graph ->
43       component array
44
45
46
47
48       val component_graph : directed_graph -> (component * int list) array
49
50
51
52
53
54
55OCamldoc                          2020-09-01Strongly_connected_components.S(3)
Impressum