1Strongly_connected_components.MakeO(C3a)ml libSrtarroyngly_connected_components.Make(3)
2
3
4

NAME

6       Strongly_connected_components.Make - no description
7

Module

9       Module   Strongly_connected_components.Make
10

Documentation

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