1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
(* TEST
include config;
include testing;
binary_modules = "config build_path_prefix_map format_doc misc identifiable numbers strongly_connected_components";
bytecode;
*)
module Int = Numbers.Int
module SCC = Strongly_connected_components.Make (Int)
let graph_1 =
[1, [2;3;4];
2, [3;5];
3, [5];
4, [1];
5, [5]]
let empty = []
let print_scc scc =
Printf.printf "begin\n";
Array.iter (function
| SCC.No_loop e -> Printf.printf "%i\n" e
| SCC.Has_loop l ->
Printf.printf "[%s]\n"
(String.concat "; " (List.map Stdlib.Int.to_string l))) scc;
Printf.printf "end\n"
let scc graph =
SCC.connected_components_sorted_from_roots_to_leaf
(Int.Map.map Int.Set.of_list (Int.Map.of_list graph))
let run () =
print_scc (scc empty);
print_scc (scc graph_1);
Format.printf "done@."
|
