ocaml: phase 5.1 union_find.ml baseline (10 nodes, 6 unions, 4 components)

Disjoint-set union with path compression:

  let make_uf n = Array.init n (fun i -> i)
  let rec find p x =
    if p.(x) = x then x
    else begin let r = find p p.(x) in p.(x) <- r; r end
  let union p x y =
    let rx = find p x in let ry = find p y in
    if rx <> ry then p.(rx) <- ry

After unioning (0,1), (2,3), (4,5), (6,7), (0,2), (4,6):
  {0,1,2,3} {4,5,6,7} {8} {9}  --> 4 components.

Tests Array.init with closure, recursive find, in-place .(i)<-r.

139 baseline programs total.

lib/ocaml/baseline/expected.json

@@ -136,6 +136,7 @@
   "triangle.ml": 11,
   "triangle_div.ml": 120,
   "twosum.ml": 5,
+  "union_find.ml": 4,
   "unique_set.ml": 9,
   "validate.ml": 417,
   "word_count.ml": 3

lib/ocaml/baseline/union_find.ml

@@ -0,0 +1,33 @@
+let make_uf n = Array.init n (fun i -> i)
+
+let rec find p x =
+  if p.(x) = x then x
+  else begin
+    let r = find p p.(x) in
+    p.(x) <- r;
+    r
+  end
+
+let union p x y =
+  let rx = find p x in
+  let ry = find p y in
+  if rx <> ry then p.(rx) <- ry
+
+let count_components p n =
+  let c = ref 0 in
+  for i = 0 to n - 1 do
+    if find p i = i then c := !c + 1
+  done;
+  !c
+
+;;
+
+let n = 10 in
+let p = make_uf n in
+union p 0 1;
+union p 2 3;
+union p 4 5;
+union p 6 7;
+union p 0 2;
+union p 4 6;
+count_components p n